Round-1 (Test Duration: 1 hour):
- The first round comprised two sections Aptitude and Technical each having 30 MCQ questions total of 60 MCQs. There was negative marking and a Sectional cutoff. I did 31 out of 60 questions.
- The quantitative aptitude part was much more predominant, the questions were more intuitive and medium-level. They were not very difficult but were tricky.
- Suggestion: I would suggest doing practice from sites like GeeksforGeeks, Indiabix, etc. as it will give the confidence to solve problems.
- The Technical part covered questions from Object Oriented Programming, data structures, and C output questions was also there.
- Suggestion: I would suggest doing quizzes to get in touch with all concepts of C and other subjects.
- Tips: Solve the questions with a calm mind. Don’t stress yourself during the test because you have to do 60 questions in 60 minutes. Don’t spend too much time on any question if you are not able to do it on the first attempt.
Round-2 (Technical Interview Round-1) :
- Questions from my Resume. Discussed skills mentioned In Resume. I mentioned MongoDB then he asked which type of DB is it and which version I have used of MongoDB.
- He asked me to write a Queue Class. I implemented all the basic functionality of a Queue like enqueue, dequeue, and peek. Then followup he asked me how will I use the unused space when pointers reach the boundary. I explained the concept of a Circular queue.
- Rotate an Array K times problem was asked. I first told brute then write optimal code. Then he said me to do not to use the library reverse function then I wrote my own reverse function for an array. This problem was a medium one.
- Later he asked me to explain all features of Object Oriented programming. He asked me to write code for polymorphism like function overloading, operator overloading, and method overriding.
- Afterward, He asked me about Joins in DBMS. He asked me to write a query for a database, with two tables in it and perform all joins between these two tables. Then he asked me about the ACID properties of DB.
- Tips: You should know each and every word of your Resume.
Round-3 (Technical Interview Round-2):
- Started with my Introduction and then directly jump to DSA Questions
- Asked me to form a 9-digit number using numbers 1 to 9 where each part of the number should be divisible by the problem length of that part. Problem Seemed to be a bit tricky . I approached this with recursion which was brute force. He asked me to optimize it I could not able to come up with optimized it further.
- He asked me concept of binary search and modification in code if we want to find the first occurrence of a number.
- Then he asked to encrypt a string such that first reverse every word in the string then encode it such that replace A with Z, B with Y, and so on and Z with A, Y with B. String may contain leading and trailing spaces. I could come up with an optimal solution.
- Then He asked me to design a class For the Elevator system such that If one presses the up or down button on any floor then whichever lift is free should reach to the requested destination.
- In the end, he asked me to write code for a spiral print of A 2D square matrix.
Recommended Articles