| Minimum Cost Good Caption |
Hard
|
|
|
| Minimum Cost to Divide Array Into Subarrays |
Hard
|
|
|
| Minimum Cost to Make Arrays Identical |
Medium
|
|
|
| Minimum Cost to Reach Every Position |
Easy
|
|
|
| Minimum Deletions for At Most K Distinct Characters |
Easy
|
|
|
| Minimum Increments for Target Multiples in an Array |
Hard
|
|
|
| Minimum Operations to Convert All Elements to Zero |
Medium
|
|
|
| Minimum Operations to Make Array Elements Zero |
Hard
|
|
|
| Minimum Operations to Make Array Sum Divisible by K |
Easy
|
|
|
| Minimum Operations to Make Character Frequencies Equal |
Hard
|
|
|
| Minimum Operations to Make Columns Strictly Increasing |
Easy
|
|
|
| Minimum Operations to Make Elements Within K Subarrays Equal |
Hard
|
|
|
| Minimum Pair Removal to Sort Array I |
Easy
|
|
|
| Minimum Pair Removal to Sort Array II |
Hard
|
|
|
| Minimum Time to Break Locks I |
Medium
|
|
|
| Number of Unique XOR Triplets I |
Medium
|
|
|
| Number of Unique XOR Triplets II |
Medium
|
|
|
| Paint House IV |
Medium
|
|
|
| Path Existence Queries in a Graph I |
Medium
|
|
|
| Path Existence Queries in a Graph II |
Hard
|
|
|
| Permutations IV |
Hard
|
|
|
| Properties Graph |
Medium
|
|
|
| Reschedule Meetings for Maximum Free Time I |
Medium
|
|
|
| Reschedule Meetings for Maximum Free Time II |
Medium
|
|
|
| Reverse Degree of a String |
Easy
|
|
|
| Select K Disjoint Special Substrings |
Medium
|
|
|
| Separate Squares I |
Medium
|
|
|
| Separate Squares II |
Hard
|
|
|
| Shortest Matching Substring |
Hard
|
|
|
| Shortest Path in a Weighted Tree |
Hard
|
|
|
| Smallest Index With Digit Sum Equal to Index |
Easy
|
|
|
| Smallest Number With All Set Bits |
Easy
|
|
|
| Smallest Palindromic Rearrangement I |
Medium
|
|
|
| Smallest Palindromic Rearrangement II |
Hard
|
|
|
| Smallest Substring With Identical Characters I |
Hard
|
|
|
| Smallest Substring With Identical Characters II |
Hard
|
|
|
| Stock Price Fluctuation |
Medium
|
two-sigma
|
|
| Subsequences with a Unique Middle Mode I |
Hard
|
|
|
| Substring Matching Pattern |
Easy
|
|
|
| Subtree Inversion Sum |
Hard
|
|
|
| Sum of Good Numbers |
Easy
|
|
|
| Sum of K Subarrays With Length at Least M |
Medium
|
|
|
| Sum of Variable Length Subarrays |
Easy
|
|
|
| Transform Array by Parity |
Easy
|
|
|
| Transformed Array |
Easy
|
|
|
| Unique 3-Digit Even Numbers |
Easy
|
|
|
| Unit Conversion I |
Medium
|
|
|
| Zero Array Transformation IV |
Medium
|
|
|
| Zigzag Grid Traversal With Skip |
Easy
|
|
|
| Design a 3D Binary Matrix with Efficient Layer Tracking |
Medium
|
|
|