Online Coding Round
It was quite simple. I got three coding questions. hosted by cocubes.com
1) An array contains both positive and negative numbers in random order. Rearrange the array elements so that all negative numbers appear before all positive numbers. https://www.w3wiki.org/move-negative-numbers-beginning-positive-end-constant-extra-space/
2) Given a Binary Tree where each node has positive and negative values. Convert this to a tree where each node contains the sum of the left and right sub trees in the original tree. The values of leaf nodes are changed to 0.https://www.w3wiki.org/convert-a-given-tree-to-sum-tree/
3) Given a binary tree. Find its maximum depth – minimum depth.
15 members selected from this round.