Filter interviews by
I applied via Referral and was interviewed before Jan 2024. There was 1 interview round.
I applied via Referral and was interviewed in Jan 2024. There was 1 interview round.
Insert a node in a Binary Search Tree (BST)
Start at the root node and compare the value of the node to be inserted with the current node
If the value is less than the current node, move to the left child. If greater, move to the right child
Repeat the process until reaching a leaf node, then insert the new node as a left or right child
Design a lift system for efficient vertical transportation
Consider the number of floors in the building
Include safety features like emergency stop button
Optimize for speed and energy efficiency
Implement a user-friendly interface for passengers
I applied via Naukri.com and was interviewed before Mar 2022. There were 4 interview rounds.
I applied via Naukri.com and was interviewed before Jul 2022. There were 3 interview rounds.
Implement binary search algorithm to find a target string in a sorted array of strings.
Ensure the array of strings is sorted before performing binary search.
Compare the target string with the middle element of the array and adjust the search range accordingly.
Repeat the process until the target string is found or the search range is exhausted.
I applied via Recruitment Consulltant and was interviewed before May 2023. There were 2 interview rounds.
Its mcqs where we need to answer 25 questions
I applied via Naukri.com and was interviewed in May 2021. There were 3 interview rounds.
I applied via Naukri.com and was interviewed in Sep 2021. There were 4 interview rounds.
Count the number of flips required to convert a binary string to alternate 0 and 1.
Iterate through the string and count the number of flips required to make it alternate.
Keep track of the current character and the expected character.
Example: 001101 -> 010101 requires 2 flips.
Example: 101010 -> 010101 requires 3 flips.
Find the maximum profit from buying and selling a stock given an array of its values.
Iterate through the array and keep track of the minimum value seen so far.
Calculate the profit at each index and update the maximum profit seen.
Return the maximum profit.
Boundary traversal of a tree
Boundary traversal involves visiting the nodes on the boundary of a tree in a specific order
Start with the root node and traverse the left boundary, then the leaf nodes from left to right, and finally the right boundary
Use recursion to traverse the left and right subtrees
Exclude the leaf nodes that are also part of the left or right boundary
Reverse a linked list in groups of k nodes.
Divide the linked list into groups of k nodes
Reverse each group of k nodes
Connect the reversed groups to form the final linked list
Use recursion or iteration to implement the solution
I applied via Approached by Company and was interviewed before Jun 2023. There were 4 interview rounds.
Machine coding - design food ordering service,
Use Dutch National Flag algorithm to sort array of 0s, 1s, and 2s in single pass.
Initialize three pointers low = 0, mid = 0, high = n-1 where n is the length of the array.
Iterate through the array and swap elements based on their values and positions.
Example: Input array ['0', '1', '2', '0', '1', '2'] should be sorted as ['0', '0', '1', '1', '2', '2'].
Return new trees after deleting specified nodes from a given tree
Traverse the tree and delete nodes that match the given list
For each deleted node, create a new tree with the remaining nodes
Return all new trees created after deletion
Restaurant management system to streamline operations, orders, inventory, and customer service.
Include features for table management, order processing, menu customization, inventory tracking, and customer feedback.
Implement user roles for staff, managers, and administrators with varying levels of access and permissions.
Integrate payment processing systems for seamless transactions and reporting.
Utilize data analytics t...
based on 1 interview
Interview experience
Amazon
Flipkart
Swiggy
Indiamart Intermesh