Envié una solicitud electrónica. Acudí a una entrevista en Amazon
Entrevista
After the online debugging, code writing, and work day simulation rounds, I was invited to a 45 minute final round interview with an engineer.
Started off with interviewer introducing themselves, then introduced myself.
The questions consisted of:
- 2 behavioral questions based on the Leadership Principles.
- Some data structures/algorithms questions (no codewriting)
- 1 LC easy/medium code writing question
Then had the chance to ask interviewer questions.
Got my offer a week later.
Preguntas de entrevista [2]
Pregunta 1
Talk about a time when you went above and beyond to help a team
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.
Solicité el puesto a través de la escuela superior o la universidad. Acudí a una entrevista en Amazon en may 2026
Entrevista
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,
Preguntas de entrevista [6]
Pregunta 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].
