Amazon Interview experience | Set 325

1st Round(Hackerrank)

• Given an array, find largest sum of

1) Contiguous subarray

2) Non Contiguous Subarray

• Largest region of cells problem

2nd Round(Written test)

• Add two numbers represented by linked list
• Get a number, find next greater element with same digits
• Given a sorted array find if a[i]+a[j]=0 (i != j)

3rd Round(ftf)

• Max Sum level in a binary tree
• https://www.geeksforgeeks.org/print-nodes-binary-tree-k-leaves/

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

All Practice Problems for Amazon !