Amazon Interview Experience for SDE-1

Round 1:

  • Find the next greater element in an array:
  • Find the next greater of next smaller  element in an array
  • Longest Palindromic String(Iterative and Recursive)
  • Longest Palindromic Subsequence

Round 2:

Find the maximum element for every window of size k.



Write edge cases,   write code for the mentioned data structure

Round 3:

Managerial Round:

Tell instances where you demonstrated Learn and Be Curious, Customer Obsession

Round 4:

Bar Raiser Round

Add one to a linked list ( Time Complexity: O(n), Space Complexity O(1))

 

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



My Personal Notes arrow_drop_up

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. 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 :


3


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