Round 1: Two questions were asked in this round. It was an online round. Questions were modifications of the problem-
30 students were shortlisted after this round.
Note: All the below rounds were virtual and took place on Google meet because of the current COVID-19 situation.
Round 2: I got 2 questions
- Print left view of a Binary Tree. It is a standard Binary Tree question. The interviewer asked me to first explain the algorithm and then asked me to dry-run my algorithm on a sample example. I was asked to write its code after that.
- Find the position of an element in a sorted array of infinite numbers. I first told him the brute force linear search approach and later switched to an O(logN) approach. If we start searching from the 0th index and then at every step multiply the interval size by 2 then the problem can be solved in O(logN). So, only 0,2,4,8,16,32..indices are needed to be checked and after we cross an element let say with index p that is greater than the current element we can apply traditional binary search on the interval [0,p] or [p/2,p] interval.
The code for this approach can be found here.
Round 3: This round was HR-CUM Technical round. I was asked to introduce myself and then the interviewer asked me common Hr questions like – why do you want to join us? , what are you expecting from this company, etc. He then asked me to choose any one project from my resume and explain in detail to him. I chose a project based on Machine Learning. I told the interviewer about the objective and working of the project and also the technicalities of the project as well. Later he chose a project from my resume himself and cross-questioned me about its working and asked me why I did that project and what were the challenges that I faced while implementing it.
Tips: Just stay calm and confident. If you are unable to think of an optimized solution start with brute force and ask for hints. In most of the interviews, the interviewer is always ready to help, and he also tries to build a solution with you. Don’t Panic and believe in yourself!!