Amazon
2015 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| Article Views I | Easy | 47.4% | TopicsDatabase |
| Maximal Rectangle | Hard | 47% | TopicsArrayDynamic ProgrammingStackMatrixMonotonic Stack |
| 100. Same Tree | Easy | 47% | TopicsTreeDepth-First SearchBreadth-First SearchBinary Tree |
| Evaluate Reverse Polish Notation | Medium | 47% | TopicsArrayMathStack |
| Intersection of Two Linked Lists | Easy | 47% | TopicsHash TableLinked ListTwo Pointers |
| 402. Remove K Digits | Medium | 47% | TopicsStringStackGreedyMonotonic Stack |
| 438. Find All Anagrams in a String | Medium | 47% | TopicsHash TableStringSliding Window |
| 525. Contiguous Array | Medium | 47% | TopicsArrayHash TablePrefix Sum |
| 704. Binary Search | Easy | 46.5% | TopicsArrayBinary Search |
| 992. Subarrays with K Different Integers | Hard | 46.5% | TopicsArrayHash TableSliding WindowCounting |
| 58. Length of Last Word | Easy | 46.1% | TopicsString |
| 130. Surrounded Regions | Medium | 46.1% | TopicsArrayDepth-First SearchBreadth-First SearchUnion-FindMatrix |
| 148. Sort List | Medium | 46.1% | TopicsLinked ListTwo PointersDivide and ConquerSortingMerge Sort |
| 567. Permutation in String | Medium | 46.1% | TopicsHash TableTwo PointersStringSliding Window |
| 852. Peak Index in a Mountain Array | Medium | 46.1% | TopicsArrayBinary SearchTernary Search |
| 2357. Make Array Zero by Subtracting Equal Amounts | Easy | 46.1% | TopicsArrayHash TableGreedySortingHeap (Priority Queue)Simulation |
| 105. Construct Binary Tree from Preorder and Inorder Traversal | Medium | 45.6% | TopicsArrayHash TableDivide and ConquerTreeBinary Tree |
| Populating Next Right Pointers in Each Node | Medium | 45.6% | TopicsLinked ListTreeDepth-First SearchBreadth-First SearchBinary Tree |
| 344. Reverse String | Easy | 45.6% | TopicsTwo PointersString |
| 417. Pacific Atlantic Water Flow | Medium | 45.6% | TopicsArrayDepth-First SearchBreadth-First SearchMatrix |
| 104. Maximum Depth of Binary Tree | Easy | 45.2% | TopicsTreeDepth-First SearchBreadth-First SearchBinary Tree |
| Rising Temperature | Easy | 45.2% | TopicsDatabase |
| 235. Lowest Common Ancestor of a Binary Search Tree | Medium | 45.2% | TopicsTreeDepth-First SearchBinary Search TreeBinary TreeBinary LiftingLowest Common Ancestor |
| Maximum Average Subarray I | Easy | 45.2% | TopicsArraySliding Window |
| Find K Closest Elements | Medium | 45.2% | TopicsArrayTwo PointersBinary SearchSliding WindowSortingHeap (Priority Queue) |
