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
- Count Subarrays With Majority Element ImediumArrayHash TableDivide and ConquerSegment Tree+3frequency 13.2
- Count Submatrices With All OnesmediumArrayDynamic ProgrammingStackMatrix+1frequency 13.2
- Count Total Number of Colored CellsmediumMathfrequency 13.2
- Count Vowel Substrings of a StringeasyHash TableStringfrequency 13.2
- Customer Placing the Largest Number of OrderseasyDatabasefrequency 13.2
- Delete Columns to Make SortedeasyArrayStringLongest Increasing Subsequencefrequency 13.2
- Detect SquaresmediumArrayHash TableDesignCounting+1frequency 13.2
- Divide Array Into Arrays With Max DifferencemediumArrayGreedySortingfrequency 13.2
- Divide Players Into Teams of Equal SkillmediumArrayHash TableTwo PointersSortingfrequency 13.2
- Divisible and Non-divisible Sums DifferenceeasyMathfrequency 13.2
- Escape the Spreading FirehardArrayBinary SearchBreadth-First SearchMatrixfrequency 13.2
- Find Center of Star GrapheasyGraph Theoryfrequency 13.2
- Find Closest Node to Given Two NodesmediumDepth-First SearchGraph Theoryfrequency 13.2
- Find Closest Number to ZeroeasyArrayfrequency 13.2
- Find Duplicate File in SystemmediumArrayHash TableStringfrequency 13.2
- Find Right IntervalmediumArrayBinary SearchSortingfrequency 13.2
- Find Subsequence of Length K With the Largest SumeasyArrayHash TableSortingHeap (Priority Queue)frequency 13.2
- Find the Maximum Length of Valid Subsequence IImediumArrayDynamic Programmingfrequency 13.2
- Find the Number of Ways to Place People ImediumArrayMathGeometrySorting+1frequency 13.2
- Find the Original Typed String IeasyStringfrequency 13.2
- Find the Original Typed String IIhardStringDynamic ProgrammingPrefix Sumfrequency 13.2
- Find the Punishment Number of an IntegermediumMathBacktrackingfrequency 13.2
- First Completely Painted Row or ColumnmediumArrayHash TableMatrixfrequency 13.2
- Fruits Into Baskets IIImediumArrayBinary SearchSegment TreeOrdered Setfrequency 13.2
- Kill ProcessmediumArrayHash TableTreeDepth-First Search+1frequency 13.2
- Least Number of Unique Integers after K RemovalsmediumArrayHash TableGreedySorting+1frequency 13.2
- Longest Balanced Subarray ImediumArrayHash TableDivide and ConquerSegment Tree+1frequency 13.2
- Longest Balanced Substring IImediumHash TableStringPrefix Sumfrequency 13.2
- Longest Continuous Increasing SubsequenceeasyArrayfrequency 13.2
- Market Analysis ImediumDatabasefrequency 13.2
- Max Difference You Can Get From Changing an IntegermediumMathGreedyfrequency 13.2
- Maximize Area of Square Hole in GridmediumArraySortingfrequency 13.2
- Maximum Good Subarray SummediumArrayHash TablePrefix Sumfrequency 13.2
- Maximum Height by Stacking CuboidshardArrayDynamic ProgrammingSortingfrequency 13.2
- Maximum Length Substring With Two OccurrenceseasyHash TableStringSliding Windowfrequency 13.2
- Maximum Number of Words Found in SentenceseasyArrayStringfrequency 13.2
- Maximum Side Length of a Square with Sum Less than or Equal to ThresholdmediumArrayBinary SearchMatrixPrefix Sumfrequency 13.2
- Maximum Sum of Two Non-Overlapping SubarraysmediumArrayDynamic ProgrammingSliding Windowfrequency 13.2
- Maximum XOR of Two Numbers in an ArraymediumArrayHash TableBit ManipulationTriefrequency 13.2
- Minimize XORmediumGreedyBit Manipulationfrequency 13.2
- Minimum Absolute DifferenceeasyArraySortingfrequency 13.2
- Minimum Cost Path with TeleportationshardArrayDynamic ProgrammingMatrixfrequency 13.2
- Minimum Increment to Make Array UniquemediumArrayGreedySortingCountingfrequency 13.2
- Minimum Index Sum of Two ListseasyArrayHash TableStringfrequency 13.2
- Minimum Moves to Equal Array ElementsmediumArrayMathfrequency 13.2
- Minimum Number of Operations to Move All Balls to Each BoxmediumArrayStringPrefix Sumfrequency 13.2
- Minimum Obstacle Removal to Reach CornerhardArrayBreadth-First SearchGraph TheoryHeap (Priority Queue)+4frequency 13.2
- Minimum Operations to Make the Integer ZeromediumBit ManipulationBrainteaserEnumerationfrequency 13.2
- Minimum Pair Removal to Sort Array IeasyArrayHash TableLinked ListHeap (Priority Queue)+3frequency 13.2
- Minimum Time to Repair CarsmediumArrayBinary Searchfrequency 13.2