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)



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.

 


Write your Interview Experience or mail it to contribute@geeksforgeeks.org



My Personal Notes arrow_drop_up


Article Tags :
Practice Tags :


Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.