# Amazon Interview Experience | 401 (3+Years Experience for SDE II)

Recently I was interviewed for **Amazon SDE II** for Amazon Pay Team. Below are the Questions :

**Round 1 : (Written : Pen & Paper) (3 Questions)**

- Given a 1D Array. Return True if there exists an element where a[i]+a[j] = 0 && i!=j.
**Reference**: GeeksforGeeks LinkInput : arr = {2,-3,4,1,-6,-4,1} Output : True Input : arr = {2,3,4,1,-6,4,1} Output : False

- Related to Buy and Sell of stock and gain maximum profit. Only 1 unit to buy or sell at a time.
**Reference**: GeeksforGeeks Link - Given a Tree (it was a BST), replace the data of all nodes which have data >= the node’s data.
**Solution**: GeeksforGeeks Link

(Even the example was same from above link ;)) - Program for n’th node from the end of a Linked List
**Solution**: GeeksforGeeks Link - Print min & max (both) of all subarray of size k
**Reference**: GeeksforGeeks Link

Note : The reference link is just for min or max. Here we need both min and max in one program. - Find the k most frequent words from a file (or a stream of input)
**Solution**: GeeksforGeeks Link - Design Debugger (Asked to almost everyone in 2nd Round)
- Design Uber App
- Print all nodes at distance K from given node
- Connect nodes at same level
- Minimum number of jumps to reach end

Round 2 : DS and Algo (F2F) (3 Questions)

Result : I was eliminated due to some basic mistakes I did (in Q3), which I just realized after leaving the Interview room. It was a nice experience.

I would also like to share few more Questions those were asked to other candidates over there :

The Interviewers were very friendly and helpful. They will help you whenever you get stuck (with Hints), but they will also check how much grab you have on basics.

Thank You!!!… Hope this will help the aspiring candidates.

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 write comments if you find anything incorrect, or you want to share more information about the topic discussed above.