π Amazon SDE Interview Experience (4 Rounds)
- Posted
- 8 May 2026
Summary
Cleared all four rounds of Amazon SDE interview focusing on DSA, LLD, system design and leadership principles.
How it went
I recently went through the Amazon SDE interview process, and hereβs a breakdown of my experience.
Round 1: DSA (2 Problems)
- Minimum Operations to Reduce an Integer to 0
Solved using an optimal approach
Focus was on choosing the right strategy (bit manipulation / greedy thinking depending on interpretation)
Discussed time complexity and edge cases clearly - String Matching Variant
Problem:
Given a string and a list of strings, return all strings from the list that are present as substrings.
Approach:
Started with a straightforward substring check
Discussed optimizations like:
Hashing / set-based lookups
Possibility of using Trie for scalability
Round 2: DSA + LLD
DSA Component:
Follow-up problem discussion based on optimizations and edge cases
LLD: Design a Stack
I was given full flexibility to design the system.
My Design:
Used Linked List as the underlying data structure
Implemented generic stack to support any data type
Covered:
push(), pop(), peek()
Error handling (empty stack)
Clean, extensible design
Round 3: Hiring Manager (HM Round)
DSA Problem:
Given k machines and n processes, assign each process:
- Start with machine i % k
- If busy β try (i + 1) % k, and so on
Return the machine handling the maximum number of processes.
Approach:
Simulated assignment with efficient tracking
Used appropriate data structures to manage availability and counts
Deep Dive on Projects
Extensive discussion on my past projects:
- Design decisions
- Trade-offs
- Challenges faced
- Real-world impact
Round 4: Leadership Principles (LP Round)
This round focused on Amazonβs Leadership Principles, including:
- Ownership
- Customer Obsession
- Bias for Action
- Dive Deep
- Deliver Results
I answered using structured examples (STAR format):
- Explained situations from my projects
- Highlighted decision-making and impact
- Showed accountability and problem-solving mindset
Questions asked (4)
- 01
Minimum Operations to Reduce an Integer to 0
Data Structures & Algorithms Β· Medium
Reduce an integer N to 0 by performing minimum operations. An operation can either subtract 1 or divide by 2 if even.
- 02
String Matching Substrings
Data Structures & Algorithms Β· Medium
Given a string and a list of strings, return all strings from the list that are present as substrings in the main string.
- 03
Process Assignment to Machines
Data Structures & Algorithms Β· Hard
Assign 'n' processes to 'k' machines such that each process starts at index i%k. If that machine is busy, go to next modulo until free one found. Return the machine handling most processes.
- 04
Stack Implementation Using LinkedList
Other Β· Easy
Design a generic Stack class supporting push(), pop(), peek() methods with error handling for empty stack scenarios.