Online Assessment
- 7 easy debugging questions
- A medium-hard difficulty Tree question.
- An easy-medium difficulty Array question.
- 24 general aptitude questions of varying difficulty levels.
- 45-50 work style based assessment
Technical Interview Round 1: The interviewer gave an introduction about himself and asked me for my introduction. Then he directly moved on to the questions.
Two questions were asked
- https://leetcode.com/problems/search-a-2d-matrix/. I gave 3 approaches of varying time complexities from O(nm) to O(log n + log m). It’s always better to provide all the approaches to the interviewer from brute force to fully optimized than giving the most optimized solution straight away.
- https://leetcode.com/problems/longest-zigzag-path-in-a-binary-tree/. I struggled a bit on this question but kept thinking out loud. As there was less time left, the interviewer gave me a hint and I was easily able to explain and code the solution after that.
Technical Interview Round 2: The interview started in a similar way as the 1st round with introductions and then moving on to the questions.
Two questions were asked in this round too
- It was a simple graph coloring based problem and I easily explained my approach and coded the solution.
- Find the length of the longest path present in a graph. The path can start from any node and end at any node. This question was another way of asking for the diameter of the graph. I explained my approach and coded the solution working in O(n) time. A good explanation of the approach can be found here https://leetcode.com/problems/minimum-height-trees/discuss/923071/Python-Find-diameter-using-2-dfs-explained/754368/
In both the rounds after every approach discussed, the interviewer asked me about the time and space complexities.
Tips:
- Don’t be intimidated by the interviewer, he/she is there to help you reach the solution.
- Thinking out loud is very important.
- Try to convert the interview into a discussion.
Verdict: About 300 students applied for the online assessment out of which 59 got the interview calls, finally 10 got the internship offers and I was one of them.