Amazon
2015 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| Maximal Square | Medium | 33.3% | TopicsArrayDynamic ProgrammingMatrix |
| 225. Implement Stack using Queues | Easy | 33.3% | TopicsStackDesignQueue |
| 323. Number of Connected Components in an Undirected Graph | Medium | 33.3% | TopicsDepth-First SearchBreadth-First SearchUnion-FindGraph Theory |
| Frog Jump | Hard | 33.3% | TopicsArrayDynamic Programming |
| 931. Minimum Falling Path Sum | Medium | 33.3% | TopicsArrayDynamic ProgrammingMatrix |
| 974. Subarray Sums Divisible by K | Medium | 33.3% | TopicsArrayHash TablePrefix Sum |
| 1071. Greatest Common Divisor of Strings | Easy | 33.3% | TopicsMathStringEuclidean AlgorithmGreatest Common Divisor |
| Students and Examinations | Easy | 33.3% | TopicsDatabase |
| Replace Employee ID With The Unique Identifier | Easy | 33.3% | TopicsDatabase |
| Find Longest Self-Contained Substring | Hard | 33.3% | TopicsHash TableStringSorting |
| 1277. Count Square Submatrices with All Ones | Medium | 33.3% | TopicsArrayDynamic ProgrammingMatrix |
| 3806. Maximum Bitwise AND After Increment Operations | Hard | 33.3% | TopicsArrayGreedyBit ManipulationSorting |
| Gray Code | Medium | 32.4% | TopicsMathBacktrackingBit Manipulation |
| Rank Scores | Medium | 32.4% | TopicsDatabase |
| Remove Linked List Elements | Easy | 32.4% | TopicsLinked ListRecursion |
| Repeated Substring Pattern | Easy | 32.4% | TopicsStringString MatchingZ AlgorithmKnuth–Morris–Pratt Algorithm |
| Design In-Memory File System | Hard | 32.4% | TopicsHash TableStringDesignTrieSorting |
| 790. Domino and Tromino Tiling | Medium | 32.4% | TopicsDynamic Programming |
| 921. Minimum Add to Make Parentheses Valid | Medium | 32.4% | TopicsStringStackGreedyBracket Sequences |
| 930. Binary Subarrays With Sum | Medium | 32.4% | TopicsArrayHash TableSliding WindowPrefix Sum |
| 962. Maximum Width Ramp | Medium | 32.4% | TopicsArrayTwo PointersStackMonotonic Stack |
| Customers Who Bought All Products | Medium | 32.4% | TopicsDatabase |
| 1353. Maximum Number of Events That Can Be Attended | Medium | 32.4% | TopicsArrayGreedySortingHeap (Priority Queue) |
| Find if Path Exists in Graph | Easy | 32.4% | TopicsDepth-First SearchBreadth-First SearchUnion-FindGraph Theory |
| 2161. Partition Array According to Given Pivot | Medium | 32.4% | TopicsArrayTwo PointersSimulation |
