Amazon Questions
Here are the LeetCode questions for Amazon.
Total: 2000
Easy: 536
Medium: 1100
Hard: 364
Progress: 0%
Topic Frequency Analysis
All Topics
| Rank | Topic | Frequency | Percentage |
|---|---|---|---|
| 1 | Array | 971 | |
| 2 | String | 445 | |
| 3 | Hash Table | 376 | |
| 4 | Dynamic Programming | 318 | |
| 5 | Math | 303 | |
| 6 | Sorting | 238 | |
| 7 | Depth-First Search | 205 | |
| 8 | Greedy | 199 | |
| 9 | Tree | 159 | |
| 10 | Binary Search | 155 | |
| 11 | Breadth-First Search | 153 | |
| 12 | Database | 144 | |
| 13 | Matrix | 142 | |
| 14 | Two Pointers | 141 | |
| 15 | Binary Tree | 130 | |
| 16 | Bit Manipulation | 128 | |
| 17 | Stack | 111 | |
| 18 | Heap (Priority Queue) | 106 | |
| 19 | Simulation | 92 | |
| 20 | Design | 90 | |
| 21 | Prefix Sum | 87 | |
| 22 | Sliding Window | 82 | |
| 23 | Graph Theory | 79 | |
| 24 | Backtracking | 76 | |
| 25 | Counting | 73 | |
| 26 | Enumeration | 55 | |
| 27 | Linked List | 54 | |
| 28 | Union-Find | 42 | |
| 29 | Monotonic Stack | 39 | |
| 30 | Ordered Set | 39 | |
| 31 | Divide and Conquer | 38 | |
| 32 | Recursion | 37 | |
| 33 | Trie | 32 | |
| 34 | Binary Search Tree | 31 | |
| 35 | Segment Tree | 30 | |
| 36 | Memoization | 27 | |
| 37 | Queue | 26 | |
| 38 | Number Theory | 25 | |
| 39 | Bitmask | 25 | |
| 40 | Binary Indexed Tree | 22 | |
| 41 | Geometry | 21 | |
| 42 | Topological Sort | 20 | |
| 43 | Combinatorics | 20 | |
| 44 | Hash Function | 19 | |
| 45 | String Matching | 15 | |
| 46 | Shortest Path | 15 | |
| 47 | Rolling Hash | 14 | |
| 48 | Data Stream | 14 | |
| 49 | Game Theory | 14 | |
| 50 | Interactive | 13 | |
| 51 | Brainteaser | 12 | |
| 52 | Merge Sort | 9 | |
| 53 | Randomized | 9 | |
| 54 | Doubly-Linked List | 8 | |
| 55 | Monotonic Queue | 8 | |
| 56 | Sweep Line | 7 | |
| 57 | Iterator | 7 | |
| 58 | Concurrency | 6 | |
| 59 | Bucket Sort | 6 | |
| 60 | Counting Sort | 6 | |
| 61 | Suffix Array | 5 | |
| 62 | Quickselect | 5 | |
| 63 | Reservoir Sampling | 4 | |
| 64 | Probability and Statistics | 4 | |
| 65 | Radix Sort | 3 | |
| 66 | Minimum Spanning Tree | 3 | |
| 67 | Shell | 2 | |
| 68 | Eulerian Circuit | 2 | |
| 69 | Strongly Connected Component | 2 | |
| No. | Question Title | Link | Difficulty | Solved |
|---|---|---|---|---|
| 1 | Maximum Capacity Within Budget | Visit | Medium | |
| 2 | Maximum Bitwise AND After Increment Operations | Visit | Hard | |
| 3 | Find Maximum Value in a Constrained Sequence | Visit | Medium | |
| 4 | Reverse String Prefix | Visit | Easy | |
| 5 | Total Sum of Interaction Cost in Tree Groups | Visit | Hard | |
| 6 | Restricted | Restricted | Hard | |
| 7 | Restricted | Restricted | Hard | |
| 8 | Restricted | Restricted | Hard | |
| 9 | Restricted | Restricted | Hard | |
| 10 | Restricted | Restricted | Hard | |
| 11 | Restricted | Restricted | Hard | |
| 12 | Restricted | Restricted | Hard | |
| 13 | Restricted | Restricted | Hard | |
| 14 | Restricted | Restricted | Hard | |
| 15 | Restricted | Restricted | Hard |
Log in to access all 2000 questions for free!
Log InFrequently Asked Questions
Common questions about Amazon interviews