Amazon Interview Experience | 1 year Experienced for SDE-1

Location:- Hyderabad

Round 1:

Written Round-



1.Print binary tree vertically.

2.Given matrix of “#”, “&”, source “S”, destinations “D”, calculate minimum number of steps required to go from Source to Destination. Can only move in four directions(up, down, right, left)

Round 2:

F2F Interview

1.Given ‘N’ houses find number of ways to paint it with ‘K’ different color such that no two adjacent houses have same color.

https://www.geeksforgeeks.org/ways-to-paint-n-paintings-such-that-adjacent-paintings-dont-have-same-colors/

2.Sliding Window Problem.Given array of N elements and integer ‘K’ find minimum and maximum in each window of length ‘K’.

https://www.geeksforgeeks.org/sliding-window-maximum-maximum-of-all-subarrays-of-size-k/

Round 3

F2F Interview:-


1.Knight Tour Problem with infinite Grid and obstructions in the path .

Round 4

F2F(Bar-Raiser)

This is probably the most important round that decides whether you will be offered the job or not.(Solely on this round.)

This round was conducted by 10 year experience employee of Amazon.

Behavioral Questions

1.What did you learn from your current organization.

2.Situation where you get a higher Priority task.

3.What is the toughest challenge that you have faced ?

and some more based on Amazons principles.

1 coding question

Check whether the given tree is complete binary tree.

Round 5 :-

Hiring Manager Round

This was telephonic 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 :


1


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