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.
Questions d'entretien [1]
Question 1
Two DSA questions (two pointers problem and a binary tree problem)
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.
Questions d'entretien [1]
Question 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.
J'ai passé un entretien chez Amazon (Tel Aviv-Yafo)
Entretien
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.
Questions d'entretien [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.