Ho sostenuto un colloquio presso Amazon (Bengaluru)
Colloquio
The interview started with a brief introduction, where I was asked to walk through my background and projects. After that, the interview moved into the technical discussion and lasted for around 1 hour in total.
The first problem was based on the two-pointer technique. I was asked to explain my approach clearly and then dry run the solution step by step on sample inputs. The interviewer focused a lot on clarity of thought and correctness. After completing the solution, I was asked about the time and space complexity and possible edge cases.
The second question was related to Binary Trees. Similar to the first question, I was expected to explain the approach before writing the code. I was asked to dry run the algorithm, explain the recursion/logic involved, and analyze the time complexity. The interviewer also checked my understanding of how the solution behaves in worst and average cases.
The interview was conducted on Amazon’s internal tool, Chime. The code had to be written on a shared screen, and it was not executed—the main focus was on problem-solving approach, logic, and explanation rather than running the code.
Overall, the environment was very chill and comfortable. The interviewer was supportive and gave enough time to think and explain each step properly. Strong emphasis was placed on DSA fundamentals, clear communication, and problem-solving approach rather than just writing code.
Domande di colloquio [1]
Domanda 1
Two DSA questions (two pointers problem and a binary tree problem)
Ho sostenuto un colloquio presso Amazon (Tel Aviv)
Colloquio
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.
Domande di colloquio [1]
Domanda 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.
Ho presentato la mia candidatura tramite l'università. Ho sostenuto un colloquio presso Amazon nel mese di mag 2026
Colloquio
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,
Domande di colloquio [6]
Domanda 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].
