I applied through university. The process took 5 weeks. I interviewed at Amazon in Jan 2012
Interview
Applied for the position via my school's career services site. Nearly 4 months later received a request to complete two phone interviews. After scheduling the interview, I was never called then received another email to reschedule the next month.
The interviewers are generally very helpful, guiding you along the write track as you answer - the first began by telling me a bit about the company and his position specifically. Be prepared to talk about your past experience, as well as answer questions about fundamental OO concepts and data structures. I was given one programming assignment in the first interview and another in the second, the second problem a slight variation of the first - be prepared to dictate your code over the phone (must be syntax-correct). I would suggest practicing by writing code on a notepad/paper instead of using an IDE. I would suggest reviewing data structures, algorithm analysis (you will be expected to analyze the time/space complexity of the functions you write). Received a response 1 week post-interview.
Interview questions [3]
Question 1
Given two int arrays, write a function which returns their intersection as an int array; analyze the time/space complexity of your function.
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].
