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
Recommended Posts:
- MakeMyTrip Interview Experience
- MakeMyTrip Interview Experience | Set 12
- MakeMyTrip Interview Experience | Set 3
- MakeMyTrip Interview Experience
- MakeMyTrip Interview Experience | Set 4
- MakeMyTrip Interview Experience 2019
- MakeMyTrip Interview Experience | Set 7 (On-Campus)
- MakeMyTrip interview experience 2018
- MakeMyTrip Interview Experience | Set 8 (On-Campus)
- MakeMyTrip Interview Experience 2019
- MakeMyTrip Interview Experience | Set 2 (On-Campus)
- MakeMyTrip Interview Experience | Set 10 (On-Campus)
- MakeMyTrip Interview Experience (On-Campus)
- MakeMyTrip Interview Experience | Set 6 (Online Coding)
- MakeMyTrip Interview Experience | (On Campus 2019)
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.
