**Round 1:**\nOnline coding and aptitude test on hackerrank.\n\n**Round 2:**\nThere were two interviewers asked me to introduce yourself and directly jumped into DS and algo questions. They asked me five DS & algo questions basically they wanted to test all data structure linear as well non-linear. I solved all the questions with fully executed code. for tree function or pseudo code is fine. After a week I got call for 2nd round of interview.\n*Below questions asked during interview:*\n* [https://leetcode.com/problems/validate-stack-sequences/](http://)\n*  find out an element in the given sorted row and coloumn matrix.\n*  [https://leetcode.com/problems/linked-list-cycle/](http://)\n*  Top view of a binary Tree\n*  psuedo code for Topological sort\n\n**Round 3:**\nAgain two interviewers started from intro and explain one of your most challenging project.some project related questions after that he asked me a coding question on DP which was very tough for me I was not prepare to that level. Basically it was hard DP problem. i was not able to solve fully i just gave the approach how we can solve it. He jumped to a LLD.\n*Below questions asked during interview:*\n* https://leetcode.com/problems/word-break-ii/\n*  Design outlook\n\n*Verdict : Rejected after 3rd Round*\n\nTips: Have good problem solving skills to solve question like hard DP.\n*All the best \' -\'*\n\n\n\n\n

Round 1:\nOnline coding and aptitude test on hackerrank.\n\nRound 2:\nThere were two interviewers asked me to introduce yourself and directly jumped into DS and