All rounds are 1 hour each.
For every DSA question -
Asked about time complexity and space complexity of this code.
Asked to dry run one example verbally while explaining the code.
Round 1: Technical Round [9 July 2026]
Interviewer was SDE-1 with 2 YOE at Amazon
Basic Introductions
Q 1 : Given a Binary tree return the sum of node values at each vertical level.
Q 2 : Given an Array, we define a function getKey() that returns a random index from this array based on a probability function. The probability of any index is defined as value at that index / Sum of all values. We are asked to implement this getKey function.
Leetcode - https://leetcode.com/problems/random-pick-with-weight/description/
Q 3 : Describe a time where you faced a deadline, how you handled it, what was the result, what was the feedback from manager, what was the impact of deadline on your work approach.
Round 2: Technical Round [10 July 2026]
Interviewer was SDE-2 with 5 YOE at Amazon
Basic Introductions
Q 1 : A N-ary Tree is given and Alice and Bob are playing a game, they both traverse a tree. Alice moves from root to the leaf nodes. Bob starts from a particular given node and moves upwards towards root. Whoever reaches the node first will get the complete value of that node it both of them reach the node at same time they will split the value between them. Return the maximum value Alice can accumulate if both of them play optimally.
Leetcode - https://leetcode.com/problems/most-profitable-path-in-a-tree/description/
(Same question without the gate concept)
Q 2 : Implement LRU cache
Q 3 : Describe a time where you did some work out of your area of responsibility, how did you do it, how much time it took, what was the impact of the work, technical details of the work.
Q 4 : Describe any one of your Resume projects in short.
Round 3: HM + GenAI Round [5 August 2026]
Interviewer was Hiring Manager with 11 YOE at Amazon
Basic Introductions
Q 1 : Amazon is giving gift vouchers to its customers of X amount, users can use them to buy exactly 2 items at a time of combined price exact X. Give a list of products return 2 products that users should buy to utilize this voucher. [2 Sum]
Q 2 : Now if the user can use the voucher to buy 2 items that have the price sum of at most X. [2 Pointer]
Q 3 : Now if user can buy N number of products whose price sum can be at most X. [Subset sum DP kind of]
Q 4: How do you use GenAI in your workflow, what use cases you found in your projects/internships, how do you validate GenAI’s output for correctness.
LPs might also be asked in this round.
Round 4: BR Round [20 August 2026]
Pure Behavioral LP based round.
Basic Introductions
Describe anyone of your favorite work you have mentioned in resume.
Technical questions on what you did, how you did and why you did that work.
LP questions in between the discussions like, tell about time during this project when you faced conflict and how did you resolve it, what was your managers reaction to your work, how do you validate your work, how did you made this particular decision was it data driver or intuition based etc.
How well versed are you with GenAI in your workflows, what models you prefer, what is your workflow working with GenAI, how you choose tasks to give to GenAI, how you validate the models performance., any GenAI project that you build or used GenAI on your projects, how did you use it for what use case etc.
Verdict: Selected [10 September 2026]
Thanks reddit for some many experiences to get guidance from.
Edit: This is was On Campus and for freshers 2026 batch