Amazon
2015 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 3666. Minimum Operations to Equalize Binary String | Hard | 10.3% | TopicsMathStringBreadth-First SearchUnion-FindOrdered Set |
| 1733. Minimum Number of People to Teach | Medium | 10.3% | TopicsArrayHash TableGreedy |
| 929. Unique Email Addresses | Easy | 10.3% | TopicsArrayHash TableString |
| 3494. Find the Minimum Amount of Time to Brew Potions | Medium | 10.3% | TopicsArraySimulationPrefix Sum |
| 3346. Maximum Frequency of an Element After Performing Operations I | Medium | 10.3% | TopicsArrayBinary SearchSliding WindowSortingPrefix Sum |
| 3354. Make Array Elements Equal to Zero | Easy | 10.3% | TopicsArraySimulationPrefix Sum |
| 3289. The Two Sneaky Numbers of Digitville | Easy | 10.3% | TopicsArrayHash TableMath |
| 3318. Find X-Sum of All K-Long Subarrays I | Easy | 10.3% | TopicsArrayHash TableSliding WindowHeap (Priority Queue) |
| 3517. Smallest Palindromic Rearrangement I | Medium | 10.3% | TopicsStringSortingCounting Sort |
| 3607. Power Grid Maintenance | Medium | 10.3% | TopicsArrayHash TableDepth-First SearchBreadth-First SearchUnion-FindGraph TheoryHeap (Priority Queue)Ordered Set |
| 2528. Maximize the Minimum Powered City | Hard | 10.3% | TopicsArrayBinary SearchGreedyQueueSliding WindowPrefix Sum |
| 2141. Maximum Running Time of N Computers | Hard | 10.3% | TopicsArrayBinary SearchGreedySorting |
| 3578. Count Partitions With Max-Min Difference at Most K | Medium | 10.3% | TopicsArrayDynamic ProgrammingQueueSliding WindowPrefix SumMonotonic Queue |
| 1822. Sign of the Product of an Array | Easy | 10.3% | TopicsArrayMath |
| 3512. Minimum Operations to Make Array Sum Divisible by K | Easy | 10.3% | TopicsArrayMath |
| 3652. Best Time to Buy and Sell Stock using Strategy | Medium | 10.3% | TopicsArraySliding WindowPrefix Sum |
| 2906. Construct Product Matrix | Medium | 10.3% | TopicsArrayMatrixPrefix Sum |
| 955. Delete Columns to Make Sorted II | Medium | 10.3% | TopicsArrayStringGreedy |
| Paint House | Medium | 10.3% | TopicsArrayDynamic Programming |
| 1013. Partition Array Into Three Parts With Equal Sum | Easy | 10.3% | TopicsArrayGreedy |
| Perfect Rectangle | Hard | 10.3% | TopicsArrayHash TableMathGeometrySweep Line |
| 3314. Construct the Minimum Bitwise Array I | Easy | 10.3% | TopicsArrayBit Manipulation |
| 805. Split Array With Same Average | Hard | 10.3% | TopicsArrayHash TableMathDynamic ProgrammingBit ManipulationMeet in the MiddleBitmask |
| 1877. Minimize Maximum Pair Sum in Array | Medium | 10.3% | TopicsArrayTwo PointersGreedySorting |
| 923. 3Sum With Multiplicity | Medium | 10.3% | TopicsArrayHash TableTwo PointersSortingCounting |
