Round 1: Online coding assessment. Two coding problems were given
- There is one Binary Search Tree whose some nodes have been swapped.In input you will be given number of nodes,In order and post order traversal of tree.Output difference between sums of odd level nodes and even level nodes.
- Apple Trees are planted in grid design such that no. of apples in each grid is |i|+|j|.In input you will be given no. of minimum apples you should have.Now calculate the perimeter of plot so that it has min. apples given in input.
After online assessment their were multiple Technical rounds in which they were asking to write code for problems on board and paper.
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.