I applied online. I interviewed at Amazon in Apr 2025
Interview
Applied on Nov 13, got the OA on Feb 19, after completing the OA received interview invite for April 24th which consisted of three rounds: round 1 — normal coding question plus discussion about my experience; round 2 — two LeetCode-style questions, one involving DFS and graphs, the other focused on a top-k pattern; round 3 — fully behavioral with a bar raiser, discussing my background, experience, and overall fit.
Interview questions [1]
Question 1
Discussing my background, experience, and overall fit
I applied through a recruiter. The process took 4 weeks. I interviewed at Amazon (Seattle, WA) in Mar 2025
Interview
The recruiter was very engaging and I had only a few weeks to practice for the interview loop. I felt like I gave god responses because I wasn't mostly stuck when doing the technical and behavioral questions.
It wasn't too difficult for my level but for some reason they needed something more from me which Amazon never really gives out.
Interview questions [1]
Question 1
- Regular Amazon Leadership principles
- Creating a spell checker, which you can also add ability to autocomplete
I applied online. The process took 2 weeks. I interviewed at Amazon (Bengaluru) in Apr 2025
Interview
The interview process consisted of multiple technical rounds. It started with an online coding assessment focusing on data structures and algorithms, followed by two technical interviews that involved problem-solving, system design basics, and core CS concepts like OS, DBMS, and OOP. One round also involved a discussion about my projects and past internship experience. The final round was with a senior engineer and focused on debugging and code optimization.
Interview questions [1]
Question 1
Q: Given an array of integers, find the length of the longest subarray with a sum equal to zero.
Q: Implement a Least Recently Used (LRU) cache.
Q: Given two sorted arrays, merge them without using extra space.
Q: Detect and remove a loop in a linked list.
Q: Implement a trie and add functions for insert, search, and delete.
Q: Write a program to perform matrix rotation by 90 degrees clockwise.
Q: Find the kth largest element in an unsorted array.
Q: Implement a stack that returns the minimum element in O(1) time.
Q: Given a binary tree, perform a zigzag level order traversal.
Q: Find the number of islands in a 2D grid (DFS/BFS-based problem).