Round 1: Aptitude
Round 2: 2 questions from data structure
Round 3: Group fly round
- Find the least common ancestor of two nodes in a binary tree.
Determine if the current root value matches one of the key values. If so, this root is returned. Else the procedure is recurred for left and right subtrees. The node which has one key in left subtree and the other key in its right subtree is the LCA. If both keys lie in left subtree, the first node whose value matches one of the key values is LCA. Similarly for right subtree. Time complexity is O(n). The interviewer asked for optimization. I suggested a better approach for BST.
- Given two sorted arrays (with repetitive elements) find the kth minimum number from both arrays.
- Maintain an index for each array, both initialized to the first element of their respective array. Loop k times and in each iteration find the minimum element among the current indices and increment the index of the array containing the minimum. If the elements are equal, increment both indices. Time complexityis O(k).
- Given a node in a BST, delete it. Parent link is not a part of the node structure.
If the node is a leaf node, delete the node.
If the node has one child replace the value of the node with the child’s value and recursively delete the child.
If the node has two children, find the inorder successor, replace the current node’s value with the inorder succesor’s value and recursively delete the inorder successor.
Time complexity is O(h). Interviewer suggested a possible optimization for one child case, that recursive deletion is not needed for one child. We only have to copy its left and right child pointers to the node which we are trying to delete.
Related Article: GeeksforGeeks Link
- Puzzle – there are nine coins, out of which one is defective (differing in weight from the others). Find the maximum number of iterations to find the defective one.
I suggested a divide and conquer approach, with maximum of 5 iterations.
- Discussion of project
- A program is running in an infinite loop in the system. If we try to run another good program while this infinite loop is executing, will the good program run?
I answered that the program will run, but the CPU utilization will be reduced.
- Write a code to implement the strtok() function in C.
- Maintain an index to represent start of next token, initialized to 0. Search the string linearly, if a match for the pattern is found, store the substring from the start index to the previous position of the pattern in a string array and update the start index for next token. Time complexity is O(n).
Interviewer wanted to know why I had used malloc() instead of static allocation.
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
- MathWorks Interview Experience (EDG, Oncampus)
- ServiceNow Interview Experience Oncampus
- UHG Interview Experience | OnCampus- 2019
- InfoEdge Interview Experience | OnCampus-2019
- Amazon Interview | Set 108 (On-Campus)
- Microsoft Interview experience for full time position of software engineer at Microsoft Ireland Research
- Microsoft Interview Experience | Set 151 (SDE-2 3.5 years experience)
- Microsoft Interview Experience | Set 169 (SDE 2 for 3.5 years experience)
- Microsoft Interview Experience (Full Time 2018 Washington DC - with 2.5 years of experience)
- Microsoft IDC Interview Experience | Set 38 (For Internship)
- Microsoft IDC Interview Experience | Set 37B
- Microsoft Interview Experience | Set 39 (On-Campus)
- Microsoft Interview Experience | Set 40 (Off-Campus)
- Microsoft Interview Experience | Set 41 (On-Campus)
- Microsoft Interview Experience | Set 42 (For SDE1)
- Microsoft Interview Experience | Set 43
- Microsoft IDC Interview Experience| Set 44
- Microsoft Interview Experience | Set 45
- Microsoft Interview Experience | Set 46 (Onsite)
- Microsoft IDC interview Experience | Set 47 (For 1.7 Years Experienced)