Myntra Interview Experience

Round 1:

  1. Given Parent Array Such that parent[i]=j where j is the parent and Value array . Need to Find Best possible sum .

    Root node will have -1 as parent.

    Best Possible sum is maximum sum in one of the tree paths.

    Integer[] parent = new Integer[] { -1, 0, 0, 2, 3 };
     Integer[] values = new Integer[] { 0, 4, 6, -11, 3 };
    Maximum sum here would be 6+0+4=10 for path 2-->0-->1.
  2. Degree of An Array.
  3. Monsoon umbrellas. 


Write your Interview Experience or mail it to

My Personal Notes arrow_drop_up

If you like GeeksforGeeks and would like to contribute, you can also write an article using or mail your article to See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.

Article Tags :
Practice Tags :

Be the First to upvote.

Please write to us at to report any issue with the above content.