Filter interviews by
Clear (1)
I applied via Recruitment Consulltant and was interviewed in May 2024. There was 1 interview round.
Retain, weak, strong, atomic are property attributes in Objective-C for memory management and thread safety.
Retain: Increases the reference count of an object.
Weak: Does not increase the reference count, used to avoid retain cycles.
Strong: Increases the reference count and keeps the object in memory until all references are removed.
Atomic: Guarantees that the value is always fully retrieved or set in a multi-threaded e
ARC (Automatic Reference Counting) is a memory management feature in Objective-C that automatically manages memory for objects.
ARC automatically inserts retain, release, and autorelease calls at compile time to manage memory.
It helps prevent memory leaks and makes memory management easier for developers.
Example: 'NSString *name = [[NSString alloc] initWithString:@"John"];' - ARC will automatically handle memory managem
Top trending discussions
I applied via Naukri.com and was interviewed before Oct 2023. There were 2 interview rounds.
Basic coding, duration 1hr
General experience discussion
30 questions test of aptitide online
A microprocessor is a small electronic device that functions as the central processing unit of a computer.
Microprocessors are made up of millions of transistors that perform calculations and execute instructions.
They are commonly found in computers, smartphones, and other electronic devices.
Examples of popular microprocessors include Intel's Core series and AMD's Ryzen series.
Microprocessors process data and perform ta...
IoT stands for Internet of Things, which refers to the network of physical devices connected to the internet, allowing them to collect and exchange data.
IoT involves connecting everyday objects to the internet to enable them to send and receive data.
Examples of IoT devices include smart thermostats, wearable fitness trackers, and connected appliances.
IoT technology enables automation, remote monitoring, and data analyt
I applied via Company Website and was interviewed before May 2022. There were 4 interview rounds.
Create applications related to ekart applications applying design pattern and OOPS concept
C# 10 introduces new features like file-scoped namespaces, global using directives, and interpolated string handlers.
File-scoped namespaces allow defining namespaces at the file level instead of wrapping everything in a namespace block.
Global using directives simplify the process of importing namespaces across the entire project.
Interpolated string handlers provide a way to customize how interpolated strings are proces
OOPs (Object-Oriented Programming) is a programming paradigm based on the concept of objects, which can contain data and code.
OOPs focuses on creating objects that interact with each other to solve a problem
Key principles include Inheritance, Encapsulation, Polymorphism, and Abstraction
Inheritance allows a class to inherit properties and behavior from another class
Encapsulation hides the internal state of an object and...
I applied via Naukri.com
OOPs concepts are the principles of Object-Oriented Programming that help in designing and implementing software systems.
Encapsulation - bundling of data and methods that operate on that data
Inheritance - ability of a class to inherit properties and methods from its parent class
Polymorphism - ability of objects to take on multiple forms or behaviors
Abstraction - hiding of complex implementation details and showing only...
I was interviewed before Mar 2021.
Round duration - 120 Minutes
Round difficulty - Medium
This was an online MCQ + coding round where we had 1 hour to solve the MCQ's and another 1 hour to solve 2 coding
questions. The MCQ's were related to both General and Technical Aptitude.
You are provided with the root node of a binary tree containing 'N' nodes and an integer value 'TARGET'. Your task is to determine the number of leaf nodes for which the sum of the no...
Calculate the number of leaf nodes in a binary tree with a path sum equal to a given target.
Traverse the binary tree from root to leaf nodes while keeping track of the sum along the path.
Recursively check if the current node is a leaf node and if the sum equals the target.
Increment a counter if the conditions are met and return the counter as the result.
Determine if two given numbers 'a' and 'b' are coprime, meaning they have no common divisors other than 1.
t
a_1 b_1
a_2 b_2
...
a_t b_t
true / false
...
Check if two numbers are coprime by finding their greatest common divisor (GCD) and determining if it is 1.
Calculate the GCD of the two numbers using Euclidean algorithm.
If GCD is 1, the numbers are coprime; otherwise, they are not.
Iterate through all pairs of numbers provided in the input.
Return true if GCD is 1, false otherwise.
Round duration - 50 Minutes
Round difficulty - Medium
This was a standard DSA round where I was given 2 coding questions - the first one was related to DP and the second one was of Linked List. I first explained my approach and then coded the solutions in a production ready manner by applying proper coding principles.
You are provided with 'N' pairs of integers such that in any given pair (a, b), the first number is always smaller than the second number, i.e., a < b. A pai...
Find the length of the longest pair chain that can be formed using given pairs.
Sort the pairs based on the second element in increasing order.
Iterate through the sorted pairs and keep track of the maximum chain length.
Update the chain length if the current pair can be added to the chain.
Return the maximum chain length at the end.
You are provided with a singly linked list of integers. Your task is to determine whether the given singly linked list is a palindrome. Return true
if it is a pali...
Check if a given singly linked list is a palindrome or not.
Use two pointers approach to find the middle of the linked list.
Reverse the second half of the linked list.
Compare the first half with the reversed second half to determine if it's a palindrome.
Round duration - 60 Minutes
Round difficulty - Medium
This round started with 2 preety decent coding questions - one from DP and the other one was from Binary Search. This was followed by some questions from OOPS and then the interview ended with the interviewer asking me the famous 3-Ants and the Triangle Puzzle.
Given an array/list of positive integers and an integer K, determine if there exists a subset whose sum equals K.
Provide true
if such a subset exists, otherwise r...
Given an array of positive integers and an integer K, determine if there exists a subset whose sum equals K.
Use dynamic programming to solve this problem efficiently
Create a 2D array to store if a subset sum is possible for each element and each sum value
Iterate through the array and update the 2D array accordingly
Check if the value at the last element and K is true to determine if a subset sum equals K
Given a rotated sorted array ARR
of size 'N' and an integer 'K', determine the index at which 'K' is present in the array.
1. If 'K' is not present...
Given a rotated sorted array, find the index of a given integer 'K'.
Use binary search to find the pivot point where the array is rotated.
Based on the pivot point, perform binary search on the appropriate half of the array to find 'K'.
Handle cases where 'K' is not present in the array by returning -1.
Static polymorphism is resolved at compile time, while dynamic polymorphism is resolved at runtime.
Static polymorphism is achieved through function overloading and operator overloading.
Dynamic polymorphism is achieved through virtual functions and function overriding.
Example of static polymorphism: function overloading in C++.
Example of dynamic polymorphism: virtual functions in C++.
Abstraction in OOP is the concept of hiding complex implementation details and showing only the necessary features to the outside world.
Abstraction allows us to focus on what an object does rather than how it does it.
It helps in reducing complexity and improving maintainability of code.
Example: In a car, we don't need to know the internal working of the engine to drive it. We just need to know how to operate the pedals
Round duration - 30 Minutes
Round difficulty - Easy
This was a Technical Cum HR round where I was first asked some basic OOPS related concepts and then we discussed
about my expectations from the company , learnings and growth in the forthcomig years. I would suggest be honest and
try to communicate your thoughts properly in these type of rounds to maximise your chances of getting selected.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I was interviewed in Jun 2021.
Round duration - 120 Minutes
Round difficulty - Medium
This was an online MCQ + coding round where we had 1 hour to solve the MCQ's and another 1 hour to solve 2 coding
questions. The MCQ's were related to both General and Technical Aptitude.
Given an integer array ARR
of size N
, your task is to find the total number of inversions that exist in the array.
An inversion is defined for a pair of integers in the...
Count the total number of inversions in an integer array.
Iterate through the array and for each pair of indices i and j, check if ARR[i] > ARR[j] and i < j.
Use a nested loop to compare all pairs of elements in the array.
Keep a count of the inversions found and return the total count at the end.
Given an array arr
of length N
consisting of integers, find the sum of the subarray (including empty subarray) with the maximum sum among all subarrays.
Find the sum of the subarray with the maximum sum among all subarrays in an array of integers.
Iterate through the array and keep track of the current sum and maximum sum.
If the current sum becomes negative, reset it to 0.
Return the maximum sum found.
Round duration - 50 Minutes
Round difficulty - Easy
This round had fairly easy coding questions compared to all the rounds and the interviewer was also quite friendly. The interview started with me giving my introduction and then the interview asked me some more questions related to my academics and projects and then finally he switched to the coding questions.
Given a matrix MAT
, your task is to return the transpose of the matrix. The transpose of a matrix is obtained by converting rows into columns and vice versa. Specificall...
Return the transpose of a given matrix by switching rows into columns and vice versa.
Iterate through the matrix and swap elements at indices (i, j) and (j, i) to obtain the transpose.
Ensure the dimensions of the transposed matrix are reversed from the original matrix.
Handle edge cases like empty matrix or single row/column matrix.
You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list.
If there is an odd number of elements, return the ...
Return the middle element of a singly linked list, or the one farther from the head if there are even elements.
Traverse the linked list with two pointers, one moving twice as fast as the other
When the fast pointer reaches the end, the slow pointer will be at the middle
If there are even elements, return the one that is farther from the head node
Handle edge cases like linked list of size 1 or no midpoint existing
Given a string str
and a character 'X', develop a function to eliminate all instances of 'X' from str
and return the resulting string.
The first lin...
Develop a function to remove all instances of a given character from a string.
Iterate through the string character by character and exclude the specified character while constructing the new string.
Use a StringBuilder or similar data structure for efficient string manipulation.
Handle edge cases such as empty string or character not found in the input string.
Ensure the function runs in O(N) time complexity where N is th
Round duration - 60 Minutes
Round difficulty - Medium
This round had 2 decent coding questions , the first one was related to Dynamic Programming and the second one was of Sorting. I explained the approaches of both the questions with appropriate complexity analysis and then coded them in a production ready manner. This was followed by the interviewer asking me an interesting puzzle to check my overall aptitude.
So, be prepared for puzzles as well while preparing for interviews.
Given an array/list of positive integers and an integer K, determine if there exists a subset whose sum equals K.
Provide true
if such a subset exists, otherwise r...
Given an array of positive integers and an integer K, determine if there exists a subset whose sum equals K.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store if a subset sum is possible for each element and each sum up to K.
Initialize the first row and column of the 2D array accordingly.
Iterate through the array and update the 2D array based on the current element and sum.
Check if the...
You are given the start and end times of 'N' intervals. Write a function to determine if any two intervals overlap.
If an interval ends at time T and anothe...
Given start and end times of intervals, determine if any two intervals overlap.
Iterate through intervals and check if any two intervals overlap by comparing their start and end times
Sort intervals based on start times for efficient comparison
Consider edge cases where intervals end and start at the same time
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
based on 1 interview
Interview experience
Senior Software Engineer
31
salaries
| ₹0 L/yr - ₹0 L/yr |
Firmware Engineer
24
salaries
| ₹0 L/yr - ₹0 L/yr |
Mechanical Engineer
20
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
19
salaries
| ₹0 L/yr - ₹0 L/yr |
Softwaretest Engineer
19
salaries
| ₹0 L/yr - ₹0 L/yr |
ASSA ABLOY
Dormakaba India
Honeywell Automation
Schneider Electric