I applied online. The process took 2 months. I interviewed at Amazon (Jerusalem, Jerusalem) in Feb 2022
Interview
first there was an 3-part online assessment:
OA1: 7 easy debugging questions in 20 minutes. java, c or c++
OA2: 2 algorithmic questions (leetcode easy-medium, hard if unlucky) in 70 minutes
OA3: workday simulation.
if passed them successfully there are final two virtual interviews (interviews via video call), one hour each.
combination of amazon leadership principals and one coding question.
and then you get an offer or get rejected
Interview questions [1]
Question 1
amazon leadership principals questions:
*Tell me about a time where you took responsibility for something that was not under your job.
*Tell me about a time when you were criticized
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].
