2324 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 2325. Decode the Message | Easy | 8.2% | TopicsHash TableString |
| 895. Maximum Frequency Stack | Hard | 8.2% | TopicsHash TableStackDesignOrdered Set |
| 3411. Maximum Subarray With Equal Products | Easy | 8.2% | TopicsArrayMathSliding WindowEnumerationNumber Theory |
| 966. Vowel Spellchecker | Medium | 8.2% | TopicsArrayHash TableString |
| 3685. Subsequence Sum After Capping Elements | Medium | 8.2% | TopicsArrayTwo PointersDynamic ProgrammingSorting |
| 3484. Design Spreadsheet | Medium | 8.2% | TopicsArrayHash TableStringDesignMatrix |
| 2300. Successful Pairs of Spells and Potions | Medium | 8.2% | TopicsArrayTwo PointersBinary SearchSorting |
| 1723. Find Minimum Time to Finish All Jobs | Hard | 8.2% | TopicsArrayDynamic ProgrammingBacktrackingBit ManipulationBitmask |
| 1928. Minimum Cost to Reach Destination in Time | Hard | 8.2% | TopicsArrayDynamic ProgrammingGraph TheoryDijkstra's Algorithm |
| 2529. Maximum Count of Positive Integer and Negative Integer | Easy | 8.2% | TopicsArrayBinary SearchCounting |
| 3354. Make Array Elements Equal to Zero | Easy | 8.2% | TopicsArraySimulationPrefix Sum |
| 1895. Largest Magic Square | Medium | 8.2% | TopicsArrayMatrixPrefix Sum |
| 3321. Find X-Sum of All K-Long Subarrays II | Hard | 8.2% | TopicsArrayHash TableSliding WindowHeap (Priority Queue) |
| 1611. Minimum One Bit Operations to Make Integers Zero | Hard | 8.2% | TopicsMathDynamic ProgrammingBit ManipulationRecursionMemoization |
| Actors and Directors Who Cooperated At Least Three Times | Easy | 8.2% | TopicsDatabase |
| Trim a Binary Search Tree | Medium | 8.2% | TopicsTreeDepth-First SearchBinary Search TreeBinary Tree |
| 3751. Total Waviness of Numbers in Range I | Medium | 8.2% | TopicsMathDynamic ProgrammingEnumeration |
| 3074. Apple Redistribution into Boxes | Easy | 8.2% | TopicsArrayGreedySorting |
| 865. Smallest Subtree with all the Deepest Nodes | Medium | 8.2% | TopicsHash TableTreeDepth-First SearchBreadth-First SearchBinary TreeBinary LiftingLowest Common AncestorDP on Trees |
| 3821. Find Nth Smallest Integer With K One Bits | Hard | 8.2% | TopicsMathBit ManipulationCombinatorics |
| 3651. Minimum Cost Path with Teleportations | Hard | 8.2% | TopicsArrayDynamic ProgrammingMatrix |
| 3743. Maximize Cyclic Partition Score | Hard | 8.2% | TopicsArrayDynamic Programming |
| 2344. Minimum Deletions to Make Array Divisible | Hard | 8.2% | TopicsArrayMathSortingHeap (Priority Queue)Number TheoryEuclidean AlgorithmGreatest Common Divisor |
| 762. Prime Number of Set Bits in Binary Representation | Easy | 8.2% | TopicsMathBit ManipulationPrimality Test |
| 3336. Find the Number of Subsequences With Equal GCD | Hard | 8.2% | TopicsArrayMathDynamic ProgrammingNumber TheoryEuclidean AlgorithmGreatest Common Divisor |
