MakeMyTrip Interview Experience | Set 16 Last Updated : 22 Jul, 2019 Improve Improve Like Article Like Save Share Report 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 All Practice Problems for MakeMyTrip ! Like Article Suggest improvement Previous OneShield Interview Experience Next MAQ Software Interview Experience | Set 18 (On Campus for FTE) Share your thoughts in the comments Add Your Comment Please Login to comment...