1st Round Written Test:
1) Print a 2d matrix in spiral form.
2) Add two linked lists and return the head of the o/p list.
2nd Face to Face Round:
1) Print the bottom and right of a binary tree.
2) One question of DP
https://www.geeksforgeeks.org/dynamic-programming-set-6-min-cost-path/ (He asked me maximum.)
In Amazon, they expect you to write production level code. No Pseudo Codes.
If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above