Status: Backend developer at Mobifly Ltd.
Position: SDE2 at Amazon
Location: Bengaluru, India

Technical onsite round 1:

 1. Past experience, what I am doing in current company
 2. Algorithm question : 
	 Given n x n matrix. 
	 Find number of possible paths to reach at destination from (0,0) cell.
	 Your method is given input k meaning you have to reach destination (k-1, k-1)
	 
	 

Technical onsite round 2:

 1.  Please explain lowest common ancestor concept. Then asked to write code for it and check it
     against test cases.

    2. Implement String Compression Algorithm . i.e if string is "aaabbb" output will be a3b3.

Thoughts:

Amazon has world class office and they are very professional as per my experience. They will give ample amount of time and you can ask questions before jumping to solve the problem directly. Should focus on edge cases and happy cases first and then deal with other failing cases.