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.
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.