2324 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 1456. Maximum Number of Vowels in a Substring of Given Length | Medium | 18.2% | TopicsStringSliding Window |
| 1508. Range Sum of Sorted Subarray Sums | Medium | 18.2% | TopicsArrayTwo PointersBinary SearchSortingPrefix Sum |
| 1525. Number of Good Ways to Split a String | Medium | 18.2% | TopicsHash TableStringDynamic ProgrammingBit ManipulationPrefix Sum |
| 1530. Number of Good Leaf Nodes Pairs | Medium | 18.2% | TopicsTreeDepth-First SearchBinary TreeDP on Trees |
| 1553. Minimum Number of Days to Eat N Oranges | Hard | 18.2% | TopicsDynamic ProgrammingMemoization |
| 1569. Number of Ways to Reorder Array to Get Same BST | Hard | 18.2% | TopicsArrayMathDivide and ConquerDynamic ProgrammingTreeUnion-FindBinary Search TreeMemoizationCombinatoricsBinary TreeFermat's Little Theorem |
| 1591. Strange Printer II | Hard | 18.2% | TopicsArrayGraph TheoryTopological SortMatrixDirected Acyclic Graph |
| 1592. Rearrange Spaces Between Words | Easy | 18.2% | TopicsString |
| 1595. Minimum Cost to Connect Two Groups of Points | Hard | 18.2% | TopicsArrayDynamic ProgrammingBit ManipulationMatrixBitmaskBipartite GraphSuccessive Shortest Path AlgorithmMatching (Graph)Minimum-Cost FlowFlow Network |
| 1600. Throne Inheritance | Medium | 18.2% | TopicsHash TableTreeDepth-First SearchDesign |
| 1622. Fancy Sequence | Hard | 18.2% | TopicsMathDesignSegment TreeNumber TheoryFermat's Little Theorem |
| 1655. Distribute Repeating Integers | Hard | 18.2% | TopicsArrayHash TableDynamic ProgrammingBacktrackingBit ManipulationCountingBitmask |
| 1751. Maximum Number of Events That Can Be Attended II | Hard | 18.2% | TopicsArrayBinary SearchDynamic ProgrammingSorting |
| 1738. Find Kth Largest XOR Coordinate Value | Medium | 18.2% | TopicsArrayDivide and ConquerBit ManipulationSortingHeap (Priority Queue)MatrixPrefix SumQuickselect |
| 1765. Map of Highest Peak | Medium | 18.2% | TopicsArrayBreadth-First SearchMatrix |
| 1770. Maximum Score from Performing Multiplication Operations | Hard | 18.2% | TopicsArrayDynamic Programming |
| 1815. Maximum Number of Groups Getting Fresh Donuts | Hard | 18.2% | TopicsArrayDynamic ProgrammingBit ManipulationMemoizationBitmask |
| 1802. Maximum Value at a Given Index in a Bounded Array | Medium | 18.2% | TopicsMathBinary SearchGreedy |
| Minimum Path Cost in a Hidden Grid | Medium | 18.2% | TopicsArrayDepth-First SearchBreadth-First SearchGraph TheoryHeap (Priority Queue)MatrixInteractiveShortest Path |
| 1993. Operations on Tree | Medium | 18.2% | TopicsArrayHash TableTreeDepth-First SearchBreadth-First SearchDesign |
| Binary Searchable Numbers in an Unsorted Array | Medium | 18.2% | TopicsArrayBinary SearchStackMonotonic Stack |
| 2059. Minimum Operations to Convert Number | Medium | 18.2% | TopicsArrayBreadth-First Search |
| 2162. Minimum Cost to Set Cooking Time | Medium | 18.2% | TopicsMathEnumeration |
| 2167. Minimum Time to Remove All Cars Containing Illegal Goods | Hard | 18.2% | TopicsStringDynamic Programming |
| 2172. Maximum AND Sum of Array | Hard | 18.2% | TopicsArrayDynamic ProgrammingBit ManipulationBitmask |
