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 Number of Tasks You Can AssignhardArrayTwo PointersBinary SearchGreedy+3frequency 18.0
- Maximum Product of Splitted Binary TreemediumTreeDepth-First SearchBinary Treefrequency 18.0
- Minimize the Maximum Difference of PairsmediumArrayBinary SearchDynamic ProgrammingGreedy+1frequency 18.0
- Minimum Cost to Hire K WorkershardArrayGreedySortingHeap (Priority Queue)frequency 18.0
- Minimum Cost to Reach Destination in TimehardArrayDynamic ProgrammingGraph TheoryDijkstra's Algorithmfrequency 18.0
- Minimum Equal Sum of Two Arrays After Replacing ZerosmediumArrayGreedyfrequency 18.0
- Minimum Fuel Cost to Report to the CapitalmediumTreeDepth-First SearchBreadth-First SearchGraph Theoryfrequency 18.0
- Minimum Initial Energy to Finish TaskshardArrayGreedySortingfrequency 18.0
- Minimum Remove to Make Valid ParenthesesmediumStringStackfrequency 18.0
- Minimum Time DifferencemediumArrayMathStringSortingfrequency 18.0
- Most Beautiful Item for Each QuerymediumArrayBinary SearchSortingfrequency 18.0
- Next Greater Node In Linked ListmediumArrayLinked ListStackMonotonic Stackfrequency 18.0
- Nim GameeasyMathBrainteaserMinimaxGame Theory+2frequency 18.0
- Not Boring MovieseasyDatabasefrequency 18.0
- Nth DigitmediumMathBinary Searchfrequency 18.0
- Number of Sub-arrays of Size K and Average Greater than or Equal to ThresholdmediumArraySliding Windowfrequency 18.0
- Number of ZigZag Arrays IhardDynamic ProgrammingPrefix Sumfrequency 18.0
- Perfect NumbereasyMathfrequency 18.0
- Possible BipartitionmediumDepth-First SearchBreadth-First SearchUnion-FindGraph Theory+2frequency 18.0
- Reordered Power of 2mediumHash TableMathSortingCounting+1frequency 18.0
- Reschedule Meetings for Maximum Free Time ImediumArrayGreedySliding Windowfrequency 18.0
- Robot Bounded In CirclemediumMathStringSimulationfrequency 18.0
- Robot Return to OrigineasyStringSimulationfrequency 18.0
- Rotating the BoxmediumArrayTwo PointersMatrixfrequency 18.0
- Smallest Even MultipleeasyMathNumber Theoryfrequency 18.0
- Sort Array By ParityeasyArrayTwo PointersSortingfrequency 18.0
- Special Binary StringhardStringDivide and ConquerSortingfrequency 18.0
- String Compression IIImediumStringfrequency 18.0
- Sum of Left LeaveseasyTreeDepth-First SearchBreadth-First SearchBinary Treefrequency 18.0
- Total Characters in String After Transformations ImediumHash TableMathStringDynamic Programming+1frequency 18.0
- Total Waviness of Numbers in Range ImediumMathDynamic ProgrammingEnumerationfrequency 18.0
- Transformed ArrayeasyArraySimulationfrequency 18.0
- Trim a Binary Search TreemediumTreeDepth-First SearchBinary Search TreeBinary Treefrequency 18.0
- Ugly Number IImediumHash TableMathDynamic ProgrammingHeap (Priority Queue)frequency 18.0
- Unique 3-Digit Even NumberseasyArrayHash TableRecursionEnumerationfrequency 18.0
- Valid Mountain ArrayeasyArrayfrequency 18.0
- Valid Phone NumberseasyShellfrequency 18.0
- Vowel SpellcheckermediumArrayHash TableStringfrequency 18.0
- Walking Robot SimulationmediumArrayHash TableSimulationfrequency 18.0
- Add to Array-Form of IntegereasyArrayMathfrequency 15.7
- Bitwise AND of Numbers RangemediumBit Manipulationfrequency 15.7
- Brick WallmediumArrayHash Tablefrequency 15.7
- Check if Number is a Sum of Powers of ThreemediumMathfrequency 15.7
- Check if a Parentheses String Can Be ValidmediumStringStackGreedyBracket Sequencesfrequency 15.7
- Count Complete Tree NodesmediumBinary SearchBit ManipulationTreeBinary Treefrequency 15.7
- Count Good Nodes in Binary TreemediumTreeDepth-First SearchBreadth-First SearchBinary Treefrequency 15.7
- Cousins in Binary TreeeasyTreeDepth-First SearchBreadth-First SearchBinary Treefrequency 15.7
- Defanging an IP AddresseasyStringfrequency 15.7
- Design Snake GamemediumArrayHash TableDesignQueue+1frequency 15.7
- Design a Stack With Increment OperationmediumArrayStackDesignfrequency 15.7