Amazon
2015 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 2499. Minimum Total Cost to Make Arrays Unequal | Hard | 5% | TopicsArrayHash TableGreedyCounting |
| 3348. Smallest Divisible Digit Product II | Hard | 5% | TopicsMathStringBacktrackingGreedyNumber Theory |
| 2652. Sum Multiples | Easy | 5% | TopicsMath |
| 3302. Find the Lexicographically Smallest Valid Sequence | Medium | 5% | TopicsTwo PointersStringDynamic ProgrammingGreedy |
| 2607. Make K-Subarray Sums Equal | Medium | 5% | TopicsArrayMathGreedySortingNumber Theory |
| 1024. Video Stitching | Medium | 5% | TopicsArrayDynamic ProgrammingGreedy |
| 3161. Block Placement Queries | Hard | 5% | TopicsArrayBinary SearchBinary Indexed TreeSegment TreeOrdered Set |
| 2183. Count Array Pairs Divisible by K | Hard | 5% | TopicsArrayHash TableMathCountingNumber TheoryEuclidean AlgorithmGreatest Common Divisor |
| 3760. Maximum Substrings With Distinct Start | Medium | 5% | TopicsHash TableString |
| 3925. Concatenate Array With Reverse | Easy | 5% | TopicsArraySimulation |
| Memoize | Medium | 5% | Topics— |
| 2080. Range Frequency Queries | Medium | 5% | TopicsArrayHash TableBinary SearchDesignSegment Tree |
| 3709. Design Exam Scores Tracker | Medium | 5% | TopicsArrayBinary SearchDesignPrefix Sum |
| 2514. Count Anagrams | Hard | 5% | TopicsHash TableMathStringCombinatoricsCountingFermat's Little Theorem |
| 2213. Longest Substring of One Repeating Character | Hard | 5% | TopicsArrayStringSegment TreeOrdered Set |
| 3095. Shortest Subarray With OR at Least K I | Easy | 5% | TopicsArrayBit ManipulationSliding Window |
| 3945. Digit Frequency Score | Easy | 5% | TopicsHash TableMath |
| Classes With at Least 5 Students | Easy | 5% | TopicsDatabase |
| 1385. Find the Distance Value Between Two Arrays | Easy | 5% | TopicsArrayTwo PointersBinary SearchSorting |
| 2366. Minimum Replacements to Sort the Array | Hard | 5% | TopicsArrayMathGreedy |
| 3046. Split the Array | Easy | 5% | TopicsArrayHash TableCounting |
| 2203. Minimum Weighted Subgraph With the Required Paths | Hard | 5% | TopicsGraph TheoryHeap (Priority Queue)Shortest Path |
| 913. Cat and Mouse | Hard | 5% | TopicsMathDynamic ProgrammingGraph TheoryTopological SortMemoizationMinimaxGame TheoryZero-Sum Game |
| Sales Person | Easy | 5% | TopicsDatabase |
| 1553. Minimum Number of Days to Eat N Oranges | Hard | 5% | TopicsDynamic ProgrammingMemoization |
