Amazon
2015 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 1889. Minimum Space Wasted From Packaging | Hard | 20.1% | TopicsArrayBinary SearchSortingPrefix Sum |
| 1942. The Number of the Smallest Unoccupied Chair | Medium | 20.1% | TopicsArrayHash TableHeap (Priority Queue) |
| Jump Game VIII | Medium | 20.1% | TopicsArrayDynamic ProgrammingStackGraph TheoryMonotonic StackShortest Path |
| Maximum of Minimum Values in All Subarrays | Medium | 20.1% | TopicsArrayStackMonotonic StackCartesian Tree |
| 1958. Check if Move is Legal | Medium | 20.1% | TopicsArrayMatrixEnumeration |
| 1955. Count Number of Special Subsequences | Hard | 20.1% | TopicsArrayDynamic Programming |
| 1976. Number of Ways to Arrive at Destination | Medium | 20.1% | TopicsDynamic ProgrammingGraph TheoryTopological SortShortest PathDijkstra's Algorithm |
| 1981. Minimize the Difference Between Target and Chosen Elements | Medium | 20.1% | TopicsArrayDynamic ProgrammingMatrix |
| 1984. Minimum Difference Between Highest and Lowest of K Scores | Easy | 20.1% | TopicsArraySliding WindowSorting |
| 2028. Find Missing Observations | Medium | 20.1% | TopicsArrayMathSimulation |
| 2053. Kth Distinct String in an Array | Easy | 20.1% | TopicsArrayHash TableStringCounting |
| 2102. Sequentially Ordinal Rank Tracker | Hard | 20.1% | TopicsDesignHeap (Priority Queue)Data StreamOrdered Set |
| 2111. Minimum Operations to Make the Array K-Increasing | Hard | 20.1% | TopicsArrayBinary SearchLongest Increasing Subsequence |
| Minimum Operations to Remove Adjacent Ones in Matrix | Hard | 20.1% | TopicsArrayDepth-First SearchGraph TheoryMatrixEdmonds–Karp AlgorithmMPM AlgorithmPush-Relabel AlgorithmFlow NetworkDinic's Algorithm |
| 2196. Create Binary Tree From Descriptions | Medium | 20.1% | TopicsArrayHash TableTreeBinary Tree |
| Longest Winning Streak | Hard | 20.1% | TopicsDatabase |
| 2223. Sum of Scores of Built Strings | Hard | 20.1% | TopicsStringBinary SearchRolling HashSuffix ArrayString MatchingHash FunctionZ AlgorithmKnuth–Morris–Pratt Algorithm |
| 2261. K Divisible Elements Subarrays | Medium | 20.1% | TopicsArrayHash TableTrieRolling HashHash FunctionEnumeration |
| Maximum Sum Score of Array | Medium | 20.1% | TopicsArrayPrefix Sum |
| Users With Two Purchases Within Seven Days | Medium | 20.1% | TopicsDatabase |
| 2287. Rearrange Characters to Make Target String | Easy | 20.1% | TopicsHash TableStringCounting |
| Number of Times a Driver Was a Passenger | Medium | 20.1% | TopicsDatabase |
| 2300. Successful Pairs of Spells and Potions | Medium | 20.1% | TopicsArrayTwo PointersBinary SearchSorting |
| Minimum Number of Keypresses | Medium | 20.1% | TopicsHash TableStringGreedySortingCounting |
| Products With Three or More Orders in Two Consecutive Years | Medium | 20.1% | TopicsDatabase |
