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
- Convert Sorted List to Binary Search TreemediumLinked ListDivide and ConquerTreeBinary Search Tree+1frequency 21.9
- Count Elements With Maximum FrequencyeasyArrayHash TableCountingfrequency 21.9
- Count Servers that CommunicatemediumArrayDepth-First SearchBreadth-First SearchUnion-Find+2frequency 21.9
- Count the Number of Fair PairsmediumArrayTwo PointersBinary SearchSortingfrequency 21.9
- Count the Number of Substrings With Dominant OnesmediumStringEnumerationfrequency 21.9
- Customer Order FrequencyeasyDatabasefrequency 21.9
- Customers With Strictly Increasing PurchaseshardDatabasefrequency 21.9
- Decode the Slanted CiphertextmediumStringSimulationfrequency 21.9
- Defuse the BombeasyArraySliding Windowfrequency 21.9
- Delete Leaves With a Given ValuemediumTreeDepth-First SearchBinary Treefrequency 21.9
- Design SQLmediumArrayHash TableStringDesignfrequency 21.9
- Difference Between Ones and Zeros in Row and ColumnmediumArrayMatrixSimulationfrequency 21.9
- Distribute Coins in Binary TreemediumTreeDepth-First SearchBinary TreeDP on Treesfrequency 21.9
- Encode and Decode StringsmediumArrayStringDesignfrequency 21.9
- Final Prices With a Special Discount in a ShopeasyArrayStackMonotonic Stackfrequency 21.9
- Find Good Days to Rob the BankmediumArrayDynamic ProgrammingPrefix Sumfrequency 21.9
- Find Maximum Non-decreasing Array LengthhardArrayBinary SearchDynamic ProgrammingStack+4frequency 21.9
- Find Minimum Time to Finish All Jobs IImediumArrayGreedySortingfrequency 21.9
- Find Number of Coins to Place in Tree NodeshardDynamic ProgrammingTreeDepth-First SearchSorting+2frequency 21.9
- Find Number of Ways to Reach the K-th StairhardMathDynamic ProgrammingBit ManipulationMemoization+1frequency 21.9
- Find Words That Can Be Formed by CharacterseasyArrayHash TableStringCountingfrequency 21.9
- Find in Mountain ArrayhardArrayBinary SearchInteractiveTernary Searchfrequency 21.9
- Find the Divisibility Array of a StringmediumArrayMathStringfrequency 21.9
- Find the Index of the Large IntegermediumArrayBinary SearchInteractivefrequency 21.9
- Find the K-or of an ArrayeasyArrayBit Manipulationfrequency 21.9
- Find the K-th Character in String Game IeasyMathBit ManipulationRecursionSimulationfrequency 21.9
- Find the Median of the Uniqueness ArrayhardArrayHash TableBinary SearchSliding Windowfrequency 21.9
- Find the Substring With Maximum CostmediumArrayHash TableStringDynamic Programmingfrequency 21.9
- Form Array by Concatenating Subarrays of Another ArraymediumArrayTwo PointersGreedyString Matching+1frequency 21.9
- Grumpy Bookstore OwnermediumArraySliding Windowfrequency 21.9
- Handshakes That Don't CrosshardMathDynamic Programmingfrequency 21.9
- House Robber IVmediumArrayBinary SearchDynamic ProgrammingGreedyfrequency 21.9
- Insufficient Nodes in Root to Leaf PathsmediumTreeDepth-First SearchBinary Treefrequency 21.9
- Length of Longest Subarray With at Most K FrequencymediumArrayHash TableSliding Windowfrequency 21.9
- Longest Happy PrefixhardStringRolling HashString MatchingHash Function+2frequency 21.9
- Longest Harmonious SubsequenceeasyArrayHash TableSliding WindowSorting+1frequency 21.9
- Magic Squares In GridmediumArrayHash TableMathMatrixfrequency 21.9
- Maximum Median Sum of Subsequences of Size 3mediumArrayMathGreedySorting+1frequency 21.9
- Maximum Number of Achievable Transfer RequestshardArrayBacktrackingBit ManipulationEnumerationfrequency 21.9
- Maximum Number of Non-Overlapping SubstringshardHash TableStringGreedySortingfrequency 21.9
- Maximum Product of Two Elements in an ArrayeasyArraySortingHeap (Priority Queue)frequency 21.9
- Maximum Star Sum of a GraphmediumArrayGreedyGraph TheorySorting+1frequency 21.9
- Minimum Distance to the Target ElementeasyArrayfrequency 21.9
- Minimum Flips to Make Binary String CoherentmediumStringfrequency 21.9
- Minimum Height TreesmediumDepth-First SearchBreadth-First SearchGraph TheoryTopological Sortfrequency 21.9
- Minimum Number of Groups to Create a Valid AssignmentmediumArrayHash TableGreedyfrequency 21.9
- Minimum Number of KeypressesmediumHash TableStringGreedySorting+1frequency 21.9
- Minimum Number of Taps to Open to Water a GardenhardArrayDynamic ProgrammingGreedyfrequency 21.9
- Minimum Score After Removals on a TreehardArrayBit ManipulationTreeDepth-First Searchfrequency 21.9
- Minimum Swaps To Make Sequences IncreasinghardArrayDynamic Programmingfrequency 21.9