Problems

Title	Difficulty	Companies	Videos
Minimum Cost Good Caption	Hard
Minimum Cost to Divide Array Into Subarrays	Hard
Minimum Cost to Make Arrays Identical	Medium
Minimum Deletions for At Most K Distinct Characters	Easy
Minimum Increments for Target Multiples in an Array	Hard
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 Threshold for Inversion Pairs Count	Medium
Minimum Time to Visit All Houses	Medium
Multiply Two Polynomials	Hard
Number of Unique XOR Triplets I	Medium
Number of Unique XOR Triplets II	Medium
Path Existence Queries in a Graph I	Medium
Path Existence Queries in a Graph II	Hard
Permutations III	Medium
Permutations IV	Hard
Properties Graph	Medium
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 Number With All Set Bits	Easy
Smallest Palindromic Rearrangement I	Medium
Smallest Palindromic Rearrangement II	Hard
Subsequences with a Unique Middle Mode I	Hard
Subsequences with a Unique Middle Mode II	Hard
Substring Matching Pattern	Easy
Sum of Variable Length Subarrays	Easy
Team Dominance by Pass Success	Hard
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