Amazon
2015 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 3650. Minimum Cost Path with Edge Reversals | Medium | 15.8% | TopicsGraph TheoryHeap (Priority Queue)Shortest Path |
| 1979. Find Greatest Common Divisor of Array | Easy | 15.8% | TopicsArrayMathNumber TheoryEuclidean AlgorithmGreatest Common Divisor |
| Customer Placing the Largest Number of Orders | Easy | 15.8% | TopicsDatabase |
| 859. Buddy Strings | Easy | 15.8% | TopicsHash TableString |
| 2144. Minimum Cost of Buying Candies With Discount | Easy | 15.8% | TopicsArrayGreedySorting |
| 3635. Earliest Finish Time for Land and Water Rides II | Medium | 15.8% | TopicsArrayTwo PointersBinary SearchGreedySorting |
| 3614. Process String with Special Operations II | Hard | 15.8% | TopicsStringSimulation |
| 1291. Sequential Digits | Medium | 15.8% | TopicsEnumeration |
| 145. Binary Tree Postorder Traversal | Easy | 13.2% | TopicsStackTreeDepth-First SearchBinary Tree |
| 154. Find Minimum in Rotated Sorted Array II | Hard | 13.2% | TopicsArrayBinary Search |
| Ugly Number II | Medium | 13.2% | TopicsHash TableMathDynamic ProgrammingHeap (Priority Queue) |
| Best Meeting Point | Hard | 13.2% | TopicsArrayMathSortingMatrix |
| Shortest Distance from All Buildings | Hard | 13.2% | TopicsArrayBreadth-First SearchMatrix |
| Longest Substring with At Most K Distinct Characters | Medium | 13.2% | TopicsHash TableStringSliding Window |
| 413. Arithmetic Slices | Medium | 13.2% | TopicsArrayDynamic ProgrammingSliding Window |
| 421. Maximum XOR of Two Numbers in an Array | Medium | 13.2% | TopicsArrayHash TableBit ManipulationTrie |
| Arithmetic Slices II - Subsequence | Hard | 13.2% | TopicsArrayDynamic Programming |
| Circular Array Loop | Medium | 13.2% | TopicsArrayHash TableTwo PointersFloyd's Cycle Finding Algorithm |
| Relative Ranks | Easy | 13.2% | TopicsArraySortingHeap (Priority Queue) |
| Investments in 2016 | Medium | 13.2% | TopicsDatabase |
| Repeated String Match | Medium | 13.2% | TopicsStringString MatchingZ AlgorithmKnuth–Morris–Pratt AlgorithmBoyer–Moore String-Search Algorithm |
| 754. Reach a Number | Medium | 13.2% | TopicsMathBinary Search |
| 826. Most Profit Assigning Work | Medium | 13.2% | TopicsArrayTwo PointersBinary SearchGreedySorting |
| 879. Profitable Schemes | Hard | 13.2% | TopicsArrayDynamic ProgrammingKnapsack Problem0-1 Knapsack |
| 938. Range Sum of BST | Easy | 13.2% | TopicsTreeDepth-First SearchBinary Search TreeBinary Tree |
