- Written Round
There were two round technical and aptitude
- Aptitude round consisted of 45 questions (50 minutes) except two passage based on logical reasoning rest were easy, time management was important in this round.
- 20 Technical questions 13 multiple choice from OS and C++, 7 questions were coding related running code were required.
After almost 15 days I got a call that I have been shortlisted for the next round.
F-2-F Round 1:
- Write a program to search an element in a row-wise and column-wise sorted 2-dimensional array .
- Write a program to convert a binary tree to a binary search tree.
- Two string are given check whether a second string is a substring of 1st string or not second string may contain wild card character like ‘*’ and ‘?’.
- Many C/C++ related question, concept like virtual function , static variable are discussed.
- Suggest a method to multiply two objects (operator overloading, proper code for overloading was required).
- F-2-F Round 2:
- Write a Recursive function to reverse a link list.
- You are given a string in which every character is followed by space u have to return n/2 string that is each character as a separate string ..extra space were not allowed.
- Many OS related questions Deadlock, Mutex, Semaphore, IPC etc.
- Many typical C/C++ declaration, memory allocation difference between new/malloc, free/delete and details about how memory allocation takes place.
- F-2-F Round 3: HR round
- Your strength
- Why adobe
many more HR questions.
- F-2-F Round 4:
- Implement a stack using two queues and queue push, pop operation proper working code where required.
- Write a function to find 2nd largest element in an array.
- Reverse a string efficiently.
- Design a chess game.
3-4 puzzle were discussed one related to time glass, one related to watch, and one related to number this one was really interesting, Puzzle was written an eight digit number in which 0th position represents the number of zero in that number, 1st position represents the number of 1’s in the number , 2nd number represents the number of 2’s in the number …so on.
Many C/C++ concept was discussed this interview went on for almost 1 hour and 20 minutes ..this was director round and fortunately went well?
- F-2-F round 5:
- U have n vending machine out of which 1 is defected find the defected machine in O(1) on solving this he modified it give a general solution for the case in which 2 machines are defected O(1) solution were required.
- U have given a link list make a new link list which is reverse of the original link list.
- Again many C/C++ and OS related conceptual questions and some general discussion on few data structure.
- F-2-F round 6:
- Write a recursive function to print directory structure. Two function were given isfolder() and openfolder().
- Write proper running code for heapsort and some discussion related to that.
- Asked 3-4 puzzle.
- Again some C/C++ related question.
If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to firstname.lastname@example.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.