Amazon
2015 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 984. String Without AAA or BBB | Medium | 7.2% | TopicsStringGreedy |
| 3206. Alternating Groups I | Easy | 7.2% | TopicsArraySliding Window |
| 1865. Finding Pairs With a Certain Sum | Medium | 7.2% | TopicsArrayHash TableDesign |
| 2338. Count the Number of Ideal Arrays | Hard | 7.2% | TopicsMathDynamic ProgrammingCombinatoricsNumber TheoryPrime FactorizationFermat's Little Theorem |
| 838. Push Dominoes | Medium | 7.2% | TopicsTwo PointersStringDynamic Programming |
| 3342. Find Minimum Time to Reach Last Room II | Medium | 7.2% | TopicsArrayGraph TheoryHeap (Priority Queue)MatrixShortest Path |
| 1931. Painting a Grid With Three Different Colors | Hard | 7.2% | TopicsDynamic ProgrammingGraph Coloring |
| 2815. Max Pair Sum in an Array | Easy | 7.2% | TopicsArrayHash Table |
| 3403. Find the Lexicographically Largest String From the Box I | Medium | 7.2% | TopicsTwo PointersStringEnumeration |
| 3445. Maximum Difference Between Even and Odd Frequency II | Hard | 7.2% | TopicsStringSliding WindowEnumerationPrefix Sum |
| 3423. Maximum Difference Between Adjacent Elements in a Circular Array | Easy | 7.2% | TopicsArray |
| 2265. Count Nodes Equal to Average of Subtree | Medium | 7.2% | TopicsTreeDepth-First SearchBinary Tree |
| 2311. Longest Binary Subsequence Less Than or Equal to K | Medium | 7.2% | TopicsStringDynamic ProgrammingGreedyMemoization |
| 783. Minimum Distance Between BST Nodes | Easy | 7.2% | TopicsTreeDepth-First SearchBreadth-First SearchBinary Search TreeBinary Tree |
| 3307. Find the K-th Character in String Game II | Hard | 7.2% | TopicsMathBit ManipulationRecursion |
| 858. Mirror Reflection | Medium | 7.2% | TopicsMathGeometryNumber TheoryLeast Common MultipleGreatest Common Divisor |
| 1900. The Earliest and Latest Rounds Where Players Compete | Hard | 7.2% | TopicsDynamic ProgrammingMemoization |
| 924. Minimize Malware Spread | Hard | 7.2% | TopicsArrayHash TableDepth-First SearchBreadth-First SearchUnion-FindGraph Theory |
| Construct the Rectangle | Easy | 7.2% | TopicsMath |
| 2771. Longest Non-decreasing Subarray From Two Arrays | Medium | 7.2% | TopicsArrayDynamic Programming |
| 2106. Maximum Fruits Harvested After at Most K Steps | Hard | 7.2% | TopicsArrayBinary SearchSliding WindowPrefix Sum |
| Patients With a Condition | Easy | 7.2% | TopicsDatabase |
| Analyze Organization Hierarchy | Hard | 7.2% | TopicsDatabase |
| 473. Matchsticks to Square | Medium | 7.2% | TopicsArrayDynamic ProgrammingBacktrackingBit ManipulationBitmask |
| Count Salary Categories | Medium | 7.2% | TopicsDatabase |
