MakeMyTrip Interview Experience | Set 16

Round 1.a
1. Min distance between two given nodes of a Binary Tree
2. Sort Array in single traversal, Without using any sorting algorithm Sort an array of 0s, 1s and 2s

Round 1.b (On paper, write any 2)
1. 0 – 1 Knapsack Problem
2. Longest Palindrome in a String
3. Diameter of Binary Tree

Round 2
1.Level order traversal in spiral form
2. Add two floating number similar to Add two numbers represented by linked lists
3.Min Cost Path



Round 3 ( Final )
Design Data Structure
-Add element =<O(n)
-get Minimum O(1)
-delete minimum(1)
Special Stack


Write your Interview Experience or mail it to contribute@geeksforgeeks.org



My Personal Notes arrow_drop_up

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.




Article Tags :
Practice Tags :


Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.