Filter interviews by
I applied via Approached by Company and was interviewed in Nov 2023. There were 3 interview rounds.
Implementing search functionality in a React application
Use state to store search query
Filter data based on search query
Display filtered results
I applied via Approached by Company and was interviewed in Oct 2022. There were 3 interview rounds.
Coding Test with DELL EMC ,RSA
Medical Assignment and to work with Medical Assistants
Hackerrank was used for test
Implement BFS algorithm to find the nearest neighbour
Create a queue to store nodes to be visited
Start with the initial node and add it to the queue
While the queue is not empty, dequeue a node, visit its neighbours, and add them to the queue
Repeat until the nearest neighbour is found
Priority queue can be implemented using a heap data structure.
Create a min heap or max heap based on the priority order needed.
Insert elements into the heap based on their priority level.
Remove elements from the heap based on their priority level.
Heapify the heap after each insertion or deletion operation.
Example: Implementing a min heap for a priority queue where lower values have higher priority.
I applied via Campus Placement and was interviewed in Jan 2016. There were 3 interview rounds.
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
To find a loop in a linked list, we use Floyd's cycle-finding algorithm.
Floyd's cycle-finding algorithm uses two pointers, one moving at twice the speed of the other.
If there is a loop in the linked list, the two pointers will eventually meet.
To detect the meeting point, we reset one of the pointers to the head of the linked list and move both pointers at the same speed.
The meeting point is the start of the loop.
LRU, MRU and LFU are caching algorithms used to manage memory in computer systems.
LRU stands for Least Recently Used and removes the least recently used items from the cache when the cache is full.
MRU stands for Most Recently Used and removes the most recently used items from the cache when the cache is full.
LFU stands for Least Frequently Used and removes the least frequently used items from the cache when the cache i...
I have the skills, experience, and passion to excel in this role.
I have a strong background in software development, with experience in multiple programming languages and frameworks.
I am a quick learner and enjoy tackling new challenges.
I am a team player and enjoy collaborating with others to achieve common goals.
I am passionate about software engineering and am always looking for ways to improve my skills and knowled...
I chose your company because of its reputation for innovation and its commitment to employee growth.
Your company has a strong reputation for innovation in the industry.
I was impressed by the emphasis on employee growth and development.
I believe that your company's values align with my own personal values.
I was excited about the opportunity to work with a talented team of engineers.
Your company's mission and vision reso
Print the level order traversal of binary tree in spiral form
Perform level order traversal of the binary tree
Alternate the direction of traversal for each level
Use a stack to reverse the order of nodes in each level
Print the nodes in the order of traversal
Find the maximum element in each subarray of size k in a given array.
Iterate through the array from index 0 to n-k.
For each subarray of size k, find the maximum element.
Store the maximum elements in a separate array.
Return the array of maximum elements.
To find the Kth largest element in two sorted arrays, we can use the merge step of merge sort algorithm.
Merge the two arrays into a single sorted array using a modified merge sort algorithm.
Return the Kth element from the merged array.
Merge two sorted arrays into one sorted array with expected time complexity of (m+n).
Use a two-pointer approach to compare elements from both arrays and merge them into the first array.
Start comparing elements from the end of both arrays and place the larger element at the end of the first array.
Continue this process until all elements from the second array are merged into the first array.
based on 1 interview
Interview experience
Staff Software Engineer
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Staff Engineer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Staff Quality Engineer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Okta
RSA Security
CyberArk
Gen