Round 1: It was an online round, having 3 programming questions to be solved in 1 hour and 30 mins, the questions were of average difficulty. All those who solved 2 questions out of 3 were selected for the next round.
Round 2: We had personal Interview in the second round, it started with my introduction and a brief discussion about my projects. Then the interviewer asked me two programming questions that I had to solve on paper. In the first question, I had to tell if a given linked list is a palindrome using O(1) space. I had to write the whole code, and they were checking for corner cases as well. In the second question, they gave me a matrix of 0s and 1s, and if a cell had zero then I was supposed to make the entire row and column as zero. I solved it in O(mn) time and O(1) space. Although I first told my brute force approach, after that I arrived at O(mn) but using O(n+m) space, and then I tried to reduce the space complexity to O(1). The interviewer was impressed by my approach.
Round 3: It was another personal interview, here I was again asked a technical question. The interviewer gave me a use case, which came down to finding k smallest element in an array, it could be done by using a heap in O(nlogn). But I wasn’t able to answer this question, I gave him my brute force approach only. So I was rejected after this round.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course. In case you are prepared, test your skills using TCS, Wipro, Amazon and Microsoft Test Serieses.