Hard

Title	Difficulty	Companies	Videos
Immutability Helper	Hard
K-Similar Strings	Hard	amazon google
Kth Smallest Amount With Single Denomination Combination	Hard
Kth Smallest Number in Multiplication Table	Hard	google uber
Last Day Where You Can Still Cross	Hard
Length of the Longest Increasing Path	Hard
Length of the Longest Valid Substring	Hard
Lexicographically Smallest Beautiful String	Hard
Longest Common Suffix Queries	Hard
Longest Winning Streak	Hard
Make Array Empty	Hard
Make Array Non-decreasing or Non-increasing	Hard
Make String Anti-palindrome	Hard
Make the XOR of All Segments Equal to Zero	Hard
Maximize Items	Hard
Maximize Number of Nice Divisors	Hard
Maximize Sum of Weights after Edge Removals	Hard
Maximize the Number of Partitions After Operations	Hard
Maximize Value of Function in a Ball Passing Game	Hard
Maximum Average Subarray II	Hard	google
Maximum Building Height	Hard
Maximum Elegance of a K-Length Subsequence	Hard
Maximum Equal Frequency	Hard	american-express
Maximum Fruits Harvested After at Most K Steps	Hard
Maximum GCD-Sum of a Subarray	Hard
Maximum Genetic Difference Query	Hard
Maximum Good People Based on Statements	Hard
Maximum Hamming Distances	Hard
Maximum Number of Groups With Increasing Length	Hard
Maximum Number of Ones	Hard	qualcomm
Maximum Number of Removal Queries That Can Be Processed I	Hard
Maximum Number of Visible Points	Hard
Maximum Number of Ways to Partition an Array	Hard
Maximum Running Time of N Computers	Hard
Maximum Score of a Node Sequence	Hard
Maximum Strong Pair XOR II	Hard
Maximum Sum Queries	Hard
Maximum Total Beauty of the Gardens	Hard
Maximum Vacation Days	Hard	facebook google microsoft uber
Maximum Value Sum by Placing Three Rooks I	Hard
Maximum XOR of Two Non-Overlapping Subtrees	Hard
Maximum XOR Score Subarray Queries	Hard
Memoize II	Hard
Merge BSTs to Create Single BST	Hard
Minimize the Maximum Adjacent Element Difference	Hard
Minimize the Total Price of the Trips	Hard
Minimum Changes to Make K Semi-palindromes	Hard
Minimum Cost to Change the Final Value of Expression	Hard
Minimum Cost to Convert String II	Hard
Minimum Degree of a Connected Trio in a Graph	Hard