Envié una solicitud electrónica. Acudí a una entrevista en Amazon (Hyderabad) en abr 2025
Entrevista
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.
Preguntas de entrevista [2]
Pregunta 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?
Standard LC mediums, nothing too crazy. Interviewer was pretty chill and was helpful in pointing me in the right direction when I needed as well. Only thing I would probably change was to study more on graph problems before hand.
Preguntas de entrevista [1]
Pregunta 1
You are given an 0-indexed integer array weights, where weights[i] represents the weight of the i-th marble, and an integer k.
Your task is to divide the marbles into k bags such that:
No bag is empty.
Each bag must contain marbles from a contiguous range of indices. That is, if a bag includes marbles at indices i and j, then all marbles with indices between i and j (inclusive) must also be included in that same bag.
The cost of a bag that includes marbles from index i to j (inclusive) is defined as weights[i] + weights[j].
The total score of a distribution is the sum of the costs of all k bags.
Return the difference between the maximum and minimum possible scores among all valid distributions.
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.
Preguntas de entrevista [1]
Pregunta 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.
