Round 1: Skype
Questions mostly on the technology you have worked on and algorithms.
Algo: Find pair in BST which sums to X.
Round 2-5 (in person)
1. Implement stack using queue.
2. Left view of Binary Tree
And few Java concepts questions.
1. Problem statement: Given a log file with sessionID, source pageId, destn pageID and Timestamp at which the page is visited. Identify all the pages that are linked and find the minimum count of the page to visit to reach P2 from P1 – Use Graph and apply BFS.
2. Design Tank Game – Identify all the classes, member variable, methods and relationship between each class. A design pattern can be applied.
1. Determine if there is a subset of the given set with sum equal to given sum
2. Implement LRU cache.
Questions on java concepts, design pattern and multithreading.
Round 5 (Hiring Manager):
Questions were mainly from resume, behavioral questions, design, and databases concept(join, query)
Note: You have to write the code on paper in each round.
If you like GeeksforGeeks and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
Whether you're preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape, GeeksforGeeks Courses
are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we've already empowered, and we're here to do the same for you. Don't miss out - check it out now!