Round 1:
1. given a binary tree, print the preorder traversal in recursive and iterative way
2. Reverse words in a given string
3. people are standing in a queue when viewed from the front, m heads are visible, and n heads from the end. Find the number of possible arrangements such that m&n remains same when viewed from front and end respectively.
Round 2:
1. https://www.geeksforgeeks.org/maximum-sum-path-right-number-triangle/
2. What is the minimum number of straight lines to connect all the dots on this grid?
Round 3:
1. Design a data structure for updating an object efficiently in a multithreaded environment. (critical section problem)
2. Singleton Design pattern.
If you like GeeksforGeeks and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to review-team@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
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!
Last Updated :
10 Jun, 2019
Like Article
Save Article