Round 1:

Ques 1:- Arrange the Array in alternate increasing decreasing order.

Ques 2:- Kth smallest element in a row-wise and column-wise sorted 2d array

Round 2:

Ques 1:- Print the path between any two nodes in a binary tree

Ques 2:- A infix expression is given how will you evaluate the expression.

Step 1:- Convert infix expression to postfix expression.

Step 2:- Evaluate Postfix expression

Round 3:

Ques 1:- Check if a Binary Tree is BST or Not

Ques 2:- Find the height of Binary Tree

Ques 3:- Two nodes of BST are swapped find the nodes.

I have given the solution for all the problem except Ques 1 of Round 2, and Solution of Ques 3 of Round 3 is not optimal according to him.

Final result;- After 3rd round HR told you didn’t clear the interview.

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.