Status: 1.5 years of experience at a startup, Bachelors IT from a Tier-2 college
Position: SDE-1 at Amazon
Location: Bangalore, Karnataka, India

I started the process through a referral.

Technical Phonescreen:

Q1: Convert a binary tree to be a right sum tree, I,e parent node should be the sum of itself + right subtree.
Q2: Design a data structure that has Add, Get, Delete and Get Random element.

Some general discussions on expirience and LP.

Onsite Round 1 (Technical):

Q1: Find Kth largest element in a list. (Solved intially with a heap but interviewer nudged me towards a partition based solution with a hint).
Q2: Convert a floating point number to a string withoug stdlib or modulus. (Only thing to keep in mind is size of float vs int when doing the conversion and where the decimal point should be)

Some discussion on LPs.

Onsite round 2 (Technical):

Q1: Merging intervals problem.
Q2: I do not remember this now, but it involved heaps.

Onsite round 3 (Hiring manager):

Lots of discussions on past experience and LP based scenarios.

After the three rounds I was told I am done for the day and that they would be in touch for another round.

Phone Interview 2 (Technical):

Q1. Verify if a Binary tree is a sum tree, i,e if the parent node must be sum of it's two children.
Q2. Same thing as above but as an n-ary tree.

After this I recieved an offer from Amazon after a Week which I accepted.

I used python for all the rounds.

Leetcode was my main source of preperation, used GeeksForGeeks as a suppliment. I used to have major nerves during interviews. I remedied this by doing a lot of mock interviews on Leetcode.