Coding Round: There were 3 questions to be solved within 70 minutes.Using STL(C++) or Collections(java) was not allowed.
- Add minimum suffix to make the String Palindrome(String)
- A binary tree is given to you and you have to replace the data value of all the nodes with the sum of data of its sub-tree excluding the node itself.
- A binary Search Tree is given to you and you have to remove all the nodes with values outside a given range while preserving the property of BST.
Everyone had different question sets and who solved all 3 were selected for the next round.
Round 1(Technical Interview 40-45 minutes): This Round was based on my CV. The question was mostly about my hackathons, personal projects, and some internships which I had done previously (15-20 min). Then questions were like the advantage of java over c++, MongoDB over SQL Databases, SQL Databases over MongoDB, Oops, SQLite vs Rooms.
Then he asked me to a few questions on DBMS and OS. Gave me a SQL table to normalize.
Then a DSA question ”You have to Design an Extension to check JAVA code in VS CODE. What Data structure will you use to check the brackets are properly opened and closed”.
Then he asked some puzzle questions. Then he asked if I had any questions for him.
Round 2 (Technical + HR Round 30-40 minutes):
- Tell me about Yourself.
- Which technology would you like to work on the most?
He stated with my previous internships. He asked me a few DS time complexities.
Then he asked me to design a contact management system. What Data Structures and Algorithms are you going to use?. This was an open-end question he added new features after some time and asked me to optimize the operations. After some time he was satisfied with the approach.
At last, he asked me if I had any questions for him.
Finally, the result came. I got the Offer.