Loading Question...
(Online Coding Round): It consisted of 3 coding questions to be solved in 1 hr 30 min. All three questions were equivalent to Leetcode medium-hard level questions. Among those who solved all three questions 40 students were shortlisted.
(Technical Round - 45 mins): In the beginning, the interviewer asked me to give a brief introduction about myself. In the Introduction, I mentioned my Internships. So as soon as my introduction got over he asked me about my project and how I did it.
Then he asked me this question: https://www.geeksforgeeks.org/dsa/maximum-sum-nodes-binary-tree-no-two-adjacent/ At first he explained the question very nicely and then asked me to code it in the google doc he shared. At first I discussed the approach with him and he was almost satisfied with my approach but he asked me to code it so that approach will be clearer. Afterwards I started coding and kept on discussing it with him parallely. Finally I wrote the code and he was fully satisfied with it. Then he asked me about the time complexity, space complexity and some moderate level OOPS, OS questions. At last he asked, Do you have any questions? After this round around 15 students were shortlisted for the next round.
(Technical Round - 45 mins): Again the interview started with a brief introduction. This round was a pure DSA round and no questions related to projects or CS Fundamentals were asked. The question which he asked me is as under :
Given a list of strings of same length and we need to return a list of list of strings such that ith column and ith row are same. Let's have a look at this testcase. Input List: {"ball", "area", leap", "lead", "lady", "cow"} Note: same words can be used multiple times. Output: b a l l a r e a l e a d l a d y We should observe that the ith Row and ith Column are the same. We need to return all such possibilities in a list of list of string and if such arrangement is not possible then simply return an empty list of list. At first I discussed the approach with the interviewer and in the beginning he was not very much satisfied with my approach and asked me to code it first. I started writing the code and parallely kept on explaining to him the code. At last I was able to write the code and he was satisfied with it and asked me to think of optimising it a bit. I was able to do so and finally he asked me about its time complexity. After this round 10 students were shortlisted for the next round.
(HR Round - 30 mins): This round was a simple discussion round and nothing was asked from my CV or any technical questions.
He first introduced himself and asked me to introduce myself. Afterwards he asked me to tell some of my college interesting incidents and then asked me to tell him my journey to IIT in brief. He also asked me to tell some of my weaknesses and strengths. Then I asked him some relevant questions related to the company and his journey in the company. Basically, the key thing in the interview was to make it interactive. At last he said it was a nice discussion overall and he will inform me about the results very soon. Finally I got selected along with 6 more students.