Amazon Interview Experience | SDE-1 Bangalore

 

Round 1: 

They asked to write solutions for 2 different quesitons mainly



  1. KMP Algorithm
  2. Find mirror of a given node in Binary tree

Round 2: 

This was a face2face round mainly involving problem solving and data structures.

  1. Minimum insertions to form a palindrome
  2. First Missing positive number in an array

Round 3:

This was again face2face round with 2 coding questions.

  1. Nodes in Top View of Binary Tree
  2. Minimum deletions required to make frequency of each letter unique

I got rejected after this round.

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 :


Be the First to upvote.


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