Applied in AUG 2025 and appeared for OA but no results for months.
In November, got an interivew call from Amazon.
Round 1:(Friday)
Two questions were asked:
Was able to solve both questions. Interviewer asked about time complexity and space complexity for each solution. Anwered it and then that was it for the round.
Round 2:(Monday)
Again two questions:
- Rotten oranges variation.
- k distance nodes in binary tree.
Was able to solve the first question easily. For second question I knew the approach where we store the parent of each node in a map and then do a BFS from given node.
However interviewer wanted me to come up with an approach without storing parent.
It took me some time to figure out the recursive approach as I had never solved this problem with recursive approach before. The interviewer asked about Time and space complexity of all these solutions. I answered it and he looked satisfied with the code and other answers and wrapped up.
Round 3 (Bar raiser):(Next wednesday)
I was told by HR that only three LP questions would be asked. I prepared my stories for FAQs.
But Interviewer gave me one DSA problem:
- Given the root of a tree, a source and a target. Find out the shortest path from source to target and print the path in given way:
'A' - If moving to left child
'B' - If moving to right child
'C' - If moving to parent
eg:
2
/ \
1 4
src: 1 target: 4
output: "CB"
I came up with an approach to store the parent of each node and then do a BFS from src and keep track of path. Interviewer asked me to optimise the solution. Suggested me not to use any extra space.
It took me around 30 mins to reach to its solution. I proposed LCA approach where I would first find LCA of both nodes and then simple dfs would have worked with slight modification for path printing.
- After this, a couple of LP scenario based question were asked. Sounded more like formality. However I gave the answers which I had prepared.
Result:
I was not sure of the outcome as my third round did not look good to me. Even I had solved the problem but it took me multiple approaches and 30 mins to reach to the desired solution.
The result was declared exactly one week after the interview and I got the email saying "Congratulations you got the job".
Compensation
Current:
company: Fintech MNC
base: 13.4 lpa
joining bonus: 3L
Relocation: 1L
performance : 10-15% of base.
YOE: 1 year 4 months
Offered:
Base: 19,17,000 lpa
joining bonus(year 1): 6,47,000
joining bonus(year 2): 5,18,000
RSUs: 15,56,000 (Vested in 4 years, 5%, 15%, 40%, 40%)
Thank you to the leetcode community. Got a lot of help in interview preperation. Posting this in case it helps someone.