Amazon
Every interview weaves in the Leadership Principles — expect a behavioral question in each round, with follow-ups that dig for data and ownership.
Typical loop
- 1Recruiter screen
- 2Online assessment: two coding problems plus a work simulation
- 3Phone screen
- 4Onsite loop: 4-5 rounds pairing coding or design with Leadership Principles
- 5Bar raiser round
Questions
Callback's practice questions and the LeetCode questions Amazon has been asking, filtered together.
Practice questions
System Design · Token bucket, sliding window, and where the counters live.
Behavioral · The most common behavioral prompt, told in STAR: a disagreement where you changed the outcome, or changed your mind.
Frontend · List state done right: keys, controlled input, and deletes.
Algorithms & Data Structures · The two-pointer warm-up: one pointer at each end.
Algorithms & Data Structures · Hash map plus doubly linked list, all operations O(1).
Asked on LeetCode
2,011 questions · all time
- Two SumeasyArrayHash Tablefrequency 100.0
- LRU CachemediumHash TableLinked ListDesignDoubly-Linked Listfrequency 88.5
- Trapping Rain WaterhardArrayTwo PointersDynamic ProgrammingStack+1frequency 88.0
- Number of IslandsmediumArrayDepth-First SearchBreadth-First SearchUnion-Find+1frequency 85.6
- Longest Substring Without Repeating CharactersmediumHash TableStringSliding Windowfrequency 84.5
- Best Time to Buy and Sell StockeasyArrayDynamic Programmingfrequency 83.8
- Group AnagramsmediumArrayHash TableStringSortingfrequency 80.6
- Add Two NumbersmediumLinked ListMathRecursionfrequency 79.7
- Longest Palindromic SubstringmediumTwo PointersStringDynamic ProgrammingManacherfrequency 78.5
- 3SummediumArrayTwo PointersSortingfrequency 78.3
- Reorganize StringmediumHash TableStringGreedySorting+2frequency 78.3
- Median of Two Sorted ArrayshardArrayBinary SearchDivide and Conquerfrequency 76.8
- Container With Most WatermediumArrayTwo PointersGreedyfrequency 76.7
- Merge IntervalsmediumArraySortingQuicksortfrequency 76.6
- Course SchedulemediumDepth-First SearchBreadth-First SearchGraph TheoryTopological Sort+1frequency 75.0
- Koko Eating BananasmediumArrayBinary Searchfrequency 74.9
- Valid ParentheseseasyStringStackBracket Sequencesfrequency 74.4
- Merge k Sorted ListshardLinked ListDivide and ConquerHeap (Priority Queue)Merge Sort+1frequency 73.9
- Rotting OrangesmediumArrayBreadth-First SearchMatrixfrequency 73.9
- Longest Common PrefixeasyArrayStringTriefrequency 73.0
- Subarray Sum Equals KmediumArrayHash TablePrefix Sumfrequency 72.9
- Maximum SubarraymediumArrayDivide and ConquerDynamic Programmingfrequency 72.0
- Top K Frequent ElementsmediumArrayHash TableDivide and ConquerSorting+4frequency 71.7
- Search in Rotated Sorted ArraymediumArrayBinary Searchfrequency 71.6
- Merge Sorted ArrayeasyArrayTwo PointersSortingfrequency 70.9
- Palindrome NumbereasyMathfrequency 70.8
- Longest Consecutive SequencemediumArrayHash TableUnion-Findfrequency 70.7
- Lowest Common Ancestor of a Binary TreemediumTreeDepth-First SearchBinary TreeBinary Lifting+1frequency 69.9
- Copy List with Random PointermediumHash TableLinked Listfrequency 69.8
- Majority ElementeasyArrayHash TableDivide and ConquerSorting+2frequency 69.6
- Generate ParenthesesmediumStringDynamic ProgrammingBacktrackingBracket Sequencesfrequency 69.1
- Word LadderhardHash TableStringBreadth-First SearchBidirectional Searchfrequency 68.3
- Jump GamemediumArrayDynamic ProgrammingGreedyfrequency 67.9
- Product of Array Except SelfmediumArrayPrefix Sumfrequency 67.5
- House RobbermediumArrayDynamic Programmingfrequency 67.3
- Climbing StairseasyMathDynamic ProgrammingMemoizationfrequency 67.0
- Letter Combinations of a Phone NumbermediumHash TableStringBacktrackingfrequency 66.9
- Merge Two Sorted ListseasyLinked ListRecursionfrequency 66.7
- Course Schedule IImediumDepth-First SearchBreadth-First SearchGraph TheoryTopological Sortfrequency 65.8
- Sliding Window MaximumhardArrayQueueSliding WindowHeap (Priority Queue)+2frequency 65.6
- Spiral MatrixmediumArrayMatrixSimulationfrequency 65.3
- Word SearchmediumArrayStringBacktrackingDepth-First Search+1frequency 65.3
- Valid AnagrameasyHash TableStringSortingfrequency 64.3
- SubsetsmediumArrayBacktrackingBit Manipulationfrequency 64.0
- Fruit Into BasketsmediumArrayHash TableSliding Windowfrequency 63.6
- Remove Duplicates from Sorted ArrayeasyArrayTwo Pointersfrequency 63.6
- Rotate ImagemediumArrayMathMatrixfrequency 63.5
- Next PermutationmediumArrayTwo Pointersfrequency 63.3
- Coin ChangemediumArrayDynamic ProgrammingBreadth-First SearchKnapsack Problem+1frequency 63.1
- Find Median from Data StreamhardTwo PointersDesignSortingHeap (Priority Queue)+1frequency 63.1