Round 1:(Coding Round)
First round was online coding round on HackerRank. It comprised of 3 coding questions and duration was 90 minutes. 2 questions were hard and 1 was medium in terms of difficulty. Efficient solution required to pass all the TCs.
People who have done 1 question completely or 2 questions partially were selected for the interview.
Each TR comprised of 3 algorithm/data structure questions. We had to give the efficient approach to all 3 questions in order to qualify for the next round.
Round 2:(Interview Round: TR-1)
1) There are N different class files which have a parent-child relationship between them. Identify an efficient order for the compilation of those class files such that parent is compiled before all its childs. (Application of Topological Sorting of a Graph)
3) A question that has to be reduced to the minimum number of steps required to reach end problem with DP approach.
Round 3: (Interview Round: TR-2)
1) There are N teams and each team consists of 3 people. Each person’s height is given for all the teams. We have to place teams one behind the other such that each person in the back team is visible from the beginning. Find the maximum number of teams that can be arranged in such an order ?
2) A binary matrix is given. 0 represent a block and 1 represents empty cell. We need identify minimum number of steps to reach from first column of matrix to last column of matrix.
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.