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
Hey geek! It's time to become a success story instead of reading them. Check out our most renowned DSA Self Paced Course, now at a student-friendly price and become industry ready. And if you are looking for a more complete interview preparation resource, check out Complete Interview Preparation Course that will prepare you for the SDE role of your dreams!
Feeling prepared enough for your interview? Test your skills with our Test Series that will help you prepare for top companies like Amazon, Microsoft, TCS, Wipro, Google and many more!
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
