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)
1.Given ‘N’ houses find number of ways to paint it with ‘K’ different color such that no two adjacent houses have same color.
2.Sliding Window Problem.Given array of N elements and integer ‘K’ find minimum and maximum in each window of length ‘K’.
1.Knight Tour Problem with infinite Grid and obstructions in the path .
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.
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.