Skip to content
Related Articles

Related Articles

Yatra.com Interview | Set 1
  • Last Updated : 28 Apr, 2017

Recently I had appeared for Yatra Interview. I would like to share my experience.

1st Round: (Technical Round)
—————————-
1. Tell me about yourself and your current company work.
2. Find whether two strings are anagrams of each other or not.What would happen if strings are very large.
3. Level Order traversal of a binary tree.
4. Given an unsorted array: Print all pairs having sum equal to given sum. After solving this, question was modified NOT to print duplicate pairs.

2nd Round: (Technical Round)
—————————-
1. Tell me about yourself and your current company work.
2. Find whether a binary tree is BST or NOT.
3. Design a stack with findMax() (getting maximum element from stack) in O(1).
4. Given a binary tree, find whether all leaves are at same level or not.
5. Check whether given linked list is palindrome or not.Write optimized code handling all edge cases.

3rd Round: (HR Round)
———————
1. Normal HR Questions.
2. Difference between HashMap & LinkedHashMap.

After few days, I got the offer :D. Thanks to GeeksForGeeks for providing solutions in a very simple manner which helped me a lot in the preparation. To crack Yatra interview, Data Structures and Algorithms concepts should be clear. Knowing Java/C++ is a plus point.

Many Many congratulations to the Author. If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

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.

My Personal Notes arrow_drop_up
Recommended Articles
Page :