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.
Asked on LeetCode
2,011 questions · all time
- Maximum Sum of Distinct Subarrays With Length KmediumArrayHash TableSliding Windowfrequency 38.2
- Partition ListmediumLinked ListTwo Pointersfrequency 38.2
- Product Sales Analysis IIImediumDatabasefrequency 38.2
- Russian Doll EnvelopeshardArrayBinary SearchDynamic ProgrammingSorting+1frequency 38.2
- Shortest Path in Binary MatrixmediumArrayBreadth-First SearchMatrixfrequency 38.2
- Sort an ArraymediumArrayDivide and ConquerSortingHeap (Priority Queue)+4frequency 38.2
- Subarray Product Less Than KmediumArrayBinary SearchSliding WindowPrefix Sumfrequency 38.2
- Substring with Concatenation of All WordshardHash TableStringSliding Windowfrequency 38.2
- Valid Parenthesis StringmediumStringDynamic ProgrammingStackGreedy+1frequency 38.2
- Can Place FlowerseasyArrayGreedyfrequency 37.4
- Construct Binary Search Tree from Preorder TraversalmediumArrayStackTreeBinary Search Tree+2frequency 37.4
- Find Missing and Repeated ValueseasyArrayHash TableMathMatrixfrequency 37.4
- Greatest Common Divisor of StringseasyMathStringEuclidean AlgorithmGreatest Common Divisorfrequency 37.4
- Insert IntervalmediumArrayfrequency 37.4
- Lexicographically Smallest Negated Permutation that Sums to TargetmediumArrayMathTwo PointersGreedy+1frequency 37.4
- Longest Common SubsequencemediumStringDynamic ProgrammingLongest Common Subsequencefrequency 37.4
- Longest Continuous Subarray With Absolute Diff Less Than or Equal to LimitmediumArrayQueueSliding WindowHeap (Priority Queue)+2frequency 37.4
- Maximum K to Sort a PermutationmediumArrayBit Manipulationfrequency 37.4
- Minimum Difference in Sums After Removal of ElementshardArrayDynamic ProgrammingHeap (Priority Queue)frequency 37.4
- TrianglemediumArrayDynamic Programmingfrequency 37.4
- Unique Number of OccurrenceseasyArrayHash Tablefrequency 37.4
- Add DigitseasyMathSimulationNumber Theoryfrequency 36.7
- Bus RouteshardArrayHash TableBreadth-First Searchfrequency 36.7
- Design In-Memory File SystemhardHash TableStringDesignTrie+1frequency 36.7
- Interleaving StringmediumStringDynamic Programmingfrequency 36.7
- Maximal SquaremediumArrayDynamic ProgrammingMatrixfrequency 36.7
- Maximum Units on a TruckeasyArrayGreedySortingfrequency 36.7
- Predict the WinnermediumArrayMathDynamic ProgrammingRecursion+3frequency 36.7
- Range Sum Query - ImmutableeasyArrayDesignPrefix Sumfrequency 36.7
- Burst BalloonshardArrayDynamic Programmingfrequency 35.9
- Count Binary SubstringseasyTwo PointersStringfrequency 35.9
- Diagonal TraversemediumArrayMatrixSimulationfrequency 35.9
- Distinct SubsequenceshardStringDynamic Programmingfrequency 35.9
- Find Pivot IndexeasyArrayPrefix Sumfrequency 35.9
- First Unique NumbermediumArrayHash TableDesignQueue+1frequency 35.9
- Implement Stack using QueueseasyStackDesignQueuefrequency 35.9
- Number of Distinct IslandsmediumArrayHash TableDepth-First SearchBreadth-First Search+4frequency 35.9
- Process String with Special Operations ImediumStringSimulationfrequency 35.9
- Single Number IImediumArrayBit Manipulationfrequency 35.9
- Apply Discount to PricesmediumStringfrequency 35.1
- Binary Tree CamerashardDynamic ProgrammingTreeDepth-First SearchBinary Tree+1frequency 35.1
- Confirmation RatemediumDatabasefrequency 35.1
- Customer Who Visited but Did Not Make Any TransactionseasyDatabasefrequency 35.1
- Department Top Three SalarieshardDatabasefrequency 35.1
- Design Add and Search Words Data StructuremediumStringDepth-First SearchDesignTriefrequency 35.1
- Find Eventual Safe StatesmediumDepth-First SearchBreadth-First SearchGraph TheoryTopological Sort+2frequency 35.1
- Find the Number of Possible Ways for an EventhardMathDynamic ProgrammingCombinatoricsfrequency 35.1
- Find the Smallest Divisor Given a ThresholdmediumArrayBinary Searchfrequency 35.1
- Flatten Binary Tree to Linked ListmediumLinked ListStackTreeDepth-First Search+1frequency 35.1
- Increasing Triplet SubsequencemediumArrayGreedyLongest Increasing Subsequencefrequency 35.1