I applied online. The process took 1+ week. I interviewed at Amazon (Bengaluru) in Jul 2025
Interview
Didn't get a shortlisted for interview, the role was SDE Intern (2m), for Indian office. The OA consisted of two questions to be solved in 90 mins. The opportunity was only for students in their penultimate year and the OA questions were comparatively easier to what is asked in the standard SDA intern role
Interview questions [2]
Question 1
The first OA question was a simple binary search question, similar to Koko eating bananas on leetcode, Given some parcels initially assigned to n delivery boys, there are k additional parcels which you have to divide among the delivery boys such that, the maximum number of parcels carried by a delivery boy is minimum.
In the 2nd problem given an unsorted array of lenth n, you can select any subarray of size k, 1<=k<=n and increase all elements in that subarray by x.
You can do this operation as many times (even 0). Output the minimum sum of all values of x over all operations, such that the final array is non-decreasing
I applied through college or university. I interviewed at Amazon (Chennai) in Feb 2025
Interview
Round 1: online coding in HackerRank (from easy to medium)
Round 2: technical HR round. You need to code in front of the interviewer(mostly DSA problems focus on dynamic programming and tries)
I applied through a recruiter. The process took 3 weeks. I interviewed at Amazon (Bengaluru) in Sep 2024
Interview
In my Amazon SDE intern interview, the process began with an OA (Online Assessment) that included debugging, data structures, and logical reasoning. After clearing it, I had a 45-minute virtual technical interview. The interviewer was friendly and started with a quick introduction, followed by one DSA question. I was asked a BFS-based problem similar to Rotten Oranges (multi-source BFS). I explained my approach, edge cases, and optimized the code. Then we discussed time and space complexity. Finally, I was asked a recent problem: Find the number of unique paths in a grid with obstacles. The interview concluded with a few behavioral questions.
Interview questions [1]
Question 1
One key thing they asked me was:
"Can you optimize your solution further or reduce the space complexity?"
This came right after I solved the BFS-based Rotten Oranges-like problem. I initially used a queue and a visited matrix, and the interviewer pushed me to think if I could avoid the extra space.