I applied online. I interviewed at Amazon (Hyderābād) in Apr 2025
Interview
The interview started with my interviewer (SDE - II) introducing himself and asking me to do the same.
We then moved on to two leetcode questions -
1. Tree based
2. Permutation/Combination
Also, asked about one of my projects that I mentioned in introduction as 5 minutes were left.
Interview questions [2]
Question 1
At Amazon,
our delivery route optimization often involves tree-like structures.
Here's an interesting problem that reflects
similar patterns:
Given a binary tree where:
Each node contains a single digit (0-9)
Each path from root to leaf represents
a number
For example: path 4+2+1 represents number 421
Write a function to compute the sum of all numbers represented by root-to-leaf paths.
Input: root - [1,2,3]
1
2 3
Output: 25
Input: root - [4,9,0,5,1]
Output: 1026
4
9. 0
5. 1
Q2 -
Amazon is developing a new word game where players rearrange letters within words while maintaining the structure of the phrase.
The game has an interesting scoring system based on valid arrangements.
Game Rules:1. Players receive a phrase where words are separated by single spaces2.
Players can shuffle letters within each word, but can't move letters between words
3. Word order must stay the same4. The goal is to find all possible unique arrangements For example, if a player gets the phrase
"code jam":
- They can create "eocd maj" (valid - letters shuffled within each word)
- They cannot create "jam code" (invalid - word order changed)
- They cannot create "codj ame" (invalid - letters moved between words)
Challenge:
You're part of the game development team, and you need to create a function that calculates how many different valid arrangements are possible for a given phrase.
Since this number can be very large, return the result modulo 10^9 + 7.
Can you help create an algorithm that counts all possible valid arrangements?
Applied online and received an Online Assessment. It consisted of two LeetCode-style coding problems with a time limit . The process was straightforward and fully automated with no human interaction at this stage.
Interview questions [1]
Question 1
Solve a coding problem involving array manipulation under a timed online assessment
There were 2 rounds- one DSA round and one HR round.
In the first round they asked me a DP + trees question which was of medium to hard difficulty.
In the second round the interviewer asked me about my resume, my projects, some computer fundamental questions.
I applied through university. I interviewed at Amazon in May 2026
Interview
This was an On Campus opportunity. First was the Online Assessment, which consisted of 2 questions, solved both. Then they scheduled two rounds of mandatory interviews, both focusing on DSA, Problem Solving, Behavioral Questions and GenAI Fluency,
Interview questions [6]
Question 1
The first question was standard Longest Common Subsequence, interviewers expected me to first explain the brute force solution and then move on to the optimal approach.
"Tell me a time when you worked on a problem which was difficult for you".
"How do you use GenAI in your day to day work?"
"Tell me about a project where you've used GenAI"
Given an array, you can do a merge operation where you merge (or sum) two adjacent equal numbers, remove both the numbers, and replace with the new merged number. For example, [3 1 1] becomes [3 2]. Now you can operate infinite number of times, and you need to return the smallest final array after doing all the possible operations optimally, e.g. for [1 1 1 1] the answer will be [4] and not [1 2 1].
