Filter interviews by
I applied via Referral and was interviewed in Jul 2024. There was 1 interview round.
Shared memory is a memory space that multiple processes can access and use to communicate with each other.
Shared memory allows multiple processes to share data without the need for inter-process communication mechanisms like pipes or sockets.
It is commonly used in parallel computing to improve performance by allowing processes to share data quickly.
Shared memory can be implemented using techniques like memory mapping o...
Write a member function to find the second largest number in an array.
Iterate through the array and keep track of the largest and second largest numbers.
Handle edge cases like when the array has less than 2 elements.
Consider sorting the array and returning the second last element for a simpler solution.
Core is the central or most important part of something. Determining the core involves identifying the key components or elements.
Core is the central or essential part of a system or object
To determine the core, identify the key components or elements that are crucial for the functionality or purpose of the system
In software QA, determining the core may involve identifying the critical features or functionalities that ...
Defect management systems track, prioritize, and resolve software issues throughout the development lifecycle.
Defects are reported by testers or users and logged into the system.
Each defect is assigned a priority level based on its impact on the software.
Defects are tracked from discovery to resolution, with status updates along the way.
Defect management systems help teams prioritize and allocate resources efficiently.
...
To add a file to Bitbucket, you can use the web interface or command line tools.
Navigate to the repository where you want to add the file
Click on the 'Add file' button or use 'git add' command to add the file
Commit the changes with a message describing the file addition
Push the changes to the remote repository
To check processes running in a Linux machine, you can use commands like ps, top, and htop.
Use 'ps' command to display information about processes
Use 'top' command to display dynamic real-time view of processes
Use 'htop' command for an interactive process viewer
Top trending discussions
I applied via Campus Placement and was interviewed in Sep 2022. There were 3 interview rounds.
I applied via Approached by Company and was interviewed before Apr 2023. There were 5 interview rounds.
Hacker rank test with easy level testing questions
Writing test cases for scenario and bug life cycle
Create test cases to cover all possible scenarios in the application
Include positive and negative test cases to ensure thorough testing
Document bug life cycle stages such as New, Assigned, In Progress, Resolved, Closed
Verify bug fixes and retest to ensure they are resolved properly
posted on 16 Sep 2021
I appeared for an interview before Sep 2020.
Round duration - 30 minutes
Round difficulty - Easy
To search for a node in a linked list, iterate through the list and compare each node's value with the target value.
Start at the head of the linked list
Iterate through each node by following the 'next' pointer
Compare the value of each node with the target value
Return the node if found, otherwise return null
To detect a loop in a linked list, we can use Floyd's Cycle Detection Algorithm.
Initialize two pointers, slow and fast, at the head of the linked list.
Move slow pointer by one step and fast pointer by two steps.
If there is a loop, the two pointers will eventually meet.
Alternatively, we can use a hash set to store visited nodes and check for duplicates.
Implement a stack using a singly linked list
Create a Node class with data and next pointer
Create a Stack class with top pointer pointing to the top of the stack
Implement push, pop, and peek operations by manipulating the linked list
Example: Node class - Node { int data; Node next; }
Round duration - 40 minutes
Round difficulty - Easy
The top view of a binary tree shows the nodes visible from the top when looking down from the root node.
The top view of a binary tree is the set of nodes visible from the top when looking down from the root node.
Nodes at the same horizontal distance from the root are considered at the same level in the top view.
If multiple nodes are at the same horizontal distance, only the topmost node at that level is included in the...
Deleting a node from a linked list involves updating pointers to maintain the list's integrity.
Identify the node to be deleted by traversing the list
Update the previous node's next pointer to skip the node to be deleted
Free the memory allocated to the node to be deleted
Do practice a lot of questions on linked list and stacks as these are two most important data structures asked in the interview. Also, try to implement it yourself without seeing the solution. Also prepare for Computer Science subjects like Operating System, Database Management System, Computer Networks, etc. I prepared them through Coding Ninjas notes which were simpler and easy to understand.
Application resume tips for other job seekersKeep your resume short and up to mark and check spellings before submitting it for the interview process.
Final outcome of the interviewSelectedI applied via Recruitment Consultant and was interviewed before May 2020. There were 3 interview rounds.
Clone a linked list with random pointers.
Create a new node for each node in the original list.
Store the mapping between the original and cloned nodes in a hash table.
Traverse the original list again and set the random pointers in the cloned list using the hash table.
Return the head of the cloned list.
posted on 7 May 2017
I appeared for an interview in Feb 2017.
malloc is a function in C that dynamically allocates memory on the heap. It is used to allocate memory for variables or data structures.
malloc is used in C programming language.
It is used to allocate memory on the heap.
malloc is different from 'new' in C++ as it does not call constructors for objects.
C++ is a general-purpose programming language while Objective C is a superset of C used for iOS and macOS development.
C++ is widely used for developing applications, games, and system software.
Objective C is mainly used for iOS and macOS development.
C++ supports both procedural and object-oriented programming paradigms.
Objective C is an object-oriented language with dynamic runtime features.
C++ has a larger community a...
Class container is a class that holds objects of other classes, while class composition is a way to combine multiple classes to create a new class.
Class container holds objects of other classes, acting as a collection or container.
Class composition combines multiple classes to create a new class with its own behavior and attributes.
In class container, the objects are typically stored in a data structure like an array o...
Divide the horses into groups of 5 and race them. Take the top 2 from each race and race them again. Finally, race the top 2 horses to determine the top 3.
Divide the horses into 3 groups of 5 and race them.
Take the top 2 horses from each race and race them again.
Finally, race the top 2 horses to determine the top 3.
Developing a real-time data processing system for a high-traffic e-commerce website
Implemented a distributed system architecture to handle large volumes of data
Optimized algorithms for efficient data processing and storage
Utilized caching mechanisms to improve system performance
Worked closely with cross-functional teams to troubleshoot and resolve issues
Example: Successfully reduced data processing time by 50% by imple...
Seeking new challenges and opportunities for growth.
Looking for a more challenging role to further develop my skills
Interested in exploring new technologies and industries
Seeking better career advancement opportunities
Want to work in a more collaborative team environment
The width of a tree is the maximum number of nodes at any level in the tree.
To calculate the width of a tree, we can perform a level order traversal and keep track of the maximum number of nodes at any level.
We can use a queue data structure to perform the level order traversal.
At each level, we count the number of nodes in the queue and update the maximum width if necessary.
I appeared for an interview in Aug 2017.
posted on 10 May 2015
Locate sum of 2 numbers in a linear array (unsorted and sorted) and their complexities
For unsorted array, use nested loops to compare each element with every other element until the sum is found
For sorted array, use two pointers approach starting from the beginning and end of the array and move them towards each other until the sum is found
Complexity for unsorted array is O(n^2) and for sorted array is O(n)
Pointers are used to manipulate memory addresses and values in C++. Increment/decrement, address of and value at operators are commonly used.
Incrementing a pointer moves it to the next memory location of the same data type
Decrementing a pointer moves it to the previous memory location of the same data type
The address of operator (&) returns the memory address of a variable
The value at operator (*) returns the value sto...
There are multiple combinations of 8-bit and 16-bit signed numbers. How many such combinations are possible?
There are 2^8 (256) possible combinations of 8-bit signed numbers.
There are 2^16 (65,536) possible combinations of 16-bit signed numbers.
To find the total number of combinations, we can add the number of combinations of 8-bit and 16-bit signed numbers.
Therefore, the total number of possible combinations is 256 + ...
Find duplicates in an array of elements in 0(n) time and 0(1) space.
Use the property of inputs to your advantage
Iterate through the array and mark elements as negative
If an element is already negative, it is a duplicate
Return all the negative elements as duplicates
Generate all combinations of digits from an array, allowing and disallowing repetition.
Use recursion or backtracking to generate combinations.
For repetition allowed: e.g., arr={1,2}, combinations are 11, 12, 21, 22.
For repetition not allowed: e.g., arr={1,2,3}, combinations are 123, 132, 213, 231, 312, 321.
Utilize a set to track used digits when repetition is not allowed.
I appeared for an interview in Aug 2017.
I lack experience in a specific technology required for the role.
I may not have experience with a specific programming language or framework mentioned in the job description.
I may not have worked on projects similar to what your company is working on.
I may not have experience with certain tools or technologies that are crucial for the role.
I appeared for an interview before May 2016.
based on 1 interview experience
Difficulty level
Duration
Technical Lead
287
salaries
| ₹20.8 L/yr - ₹37.7 L/yr |
Senior Software Engineer
138
salaries
| ₹13.7 L/yr - ₹24 L/yr |
Manufacturing Engineer
97
salaries
| ₹7.5 L/yr - ₹13.8 L/yr |
Software Engineer
88
salaries
| ₹11.5 L/yr - ₹25.1 L/yr |
Senior Engineer Mechanical
74
salaries
| ₹11 L/yr - ₹18 L/yr |
Qualcomm
Intel
Molex
TDK India Private Limited