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

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.   In case you are prepared, test your skills using TCS, Wipro, Amazon and Microsoft Test Serieses.