Round 1:
Resume Shortlist round: We were asked to upload our resume on the dropbox (Linked shared by them) and after resume shortlisting around 400 students were shortlisted for Online test.
Online Test: Online round had aptitude and 3 coding questions, There were questions ( 15 Logical + 15 Quantitative + 10 English reasoning + 3 Coding questions). Time given was less and there was sectional cutoffs and sectional timings. Online round was quite competitive and around 25 students were shortlisted from 400 students. Aptitude questions were very challenging . Selection was basically based on coding questions which were of 50, 50 and 75 marks each.
Round 2:
Tech Round 1 (Hangout Interview): The interviewer was very kind and polite. He started asking basic questions from my resume.Then he came on asking about my project, and there was extensive discussion about my projects and resume. He was very interested in the project and asked me to explain fairly on the paper. Then he asked me to explain the algorithm used in the project and then he asked a few tricky questions on that algorithm. I was able to answer some of them and for rest, I gave him a basic idea. He was satisfied.
Then he asked some puzzles from GeeksforGeeks:
I had studied this on GeeksforGeeks so I acted well about not knowing it but he caught me, and gave me a different puzzle.
https://www.mathsisfun.com/puzzles/measuring-4-and-4-litres-solution.html
I approached the solution in the manner he was expecting.
After these two puzzles he wanted to see my thinking ability on a guesstimate question
He asked me the approach to find the number of white swift cars in Delhi.
( https://www.quora.com/I-recently-gave-an-interview-and-was-asked-How-many-red-colored-Swift-cars-are-there-in-Delhi-How-to-approach-this-problem)
Then he asked me basic questions of Data Structures and algorithms mostly depending upon linked List and hash maps.
- Write a code for Removing Duplicates from a sorted link list on their live document sharing.( https://www.geeksforgeeks.org/dsa/remove-duplicates-from-a-sorted-linked-list/)
- Algorithm to minimum time required to ripe all oranges(https://www.geeksforgeeks.org/dsa/minimum-time-required-so-that-all-oranges-become-rotten/)
- Abstraction And Inheritance with codes and proper explanation.
- Asked about my projects. I told him about my projects and later he asked me a question about my project.
- Static and final keywords.
- Indepth discussion about the concepts of OOPS.
- He gave me two tables and asked me to join them with SQL.
- Discussion about Sql Joins and keywords.