Hard

Title	Difficulty	Companies	Videos
Maximum of Two Numbers Without Conditionals	Hard	nvidia
Maximum Weight Spanning Tree	Hard	microsoft
Blackjack Optimal Strategy with Known Card Sequence	Hard	MIT
Check If Digits Are Equal in String After Operations II	Hard
Concatenated Divisibility	Hard
Count Beautiful Numbers	Hard
Count Connected Components in LCM Graph	Hard
Count Non-Decreasing Subarrays After K Operations	Hard
Count Numbers with Non-Decreasing Digits	Hard
Count Substrings Divisible By Last Digit	Hard
Equal Sum Grid Partition II	Hard
Find Invalid IP Addresses	Hard
Find Sum of Array Product of Magical Sequences	Hard
Find the Lexicographically Largest String From the Box II	Hard
Find X Value of Array II	Hard
First Letter Capitalization II	Hard
Frequencies of Shortest Supersequences	Hard
Length of Longest V-Shaped Diagonal Segment	Hard
Lexicographically Smallest Generated String	Hard
Longest Common Prefix of K Strings After Removal	Hard
Longest Palindrome After Substring Concatenation II	Hard
Longest Special Path	Hard
Longest Special Path II	Hard
Manhattan Distances of All Arrangements of Pieces	Hard
Maximize Active Section with Trade II	Hard
Maximize Subarray Sum After Removing All Occurrences of One Element	Hard
Maximize Subarrays After Removing One Conflicting Pair	Hard
Maximize the Distance Between Points on a Square	Hard
Maximize the Minimum Game Score	Hard
Maximum and Minimum Sums of at Most Size K Subarrays	Hard
Maximum Area Rectangle With Point Constraints II	Hard
Maximum Product of Subsequences With an Alternating Sum Equal to K	Hard
Maximum Profit from Valid Topological Order in DAG	Hard
Maximum Score of Non-overlapping Intervals	Hard
Maximum Sum of Edge Values in a Graph	Hard
Merge Operations for Minimum Travel Time	Hard
Minimum Cost Good Caption	Hard
Minimum Cost to Divide Array Into Subarrays	Hard
Minimum Increments for Target Multiples in an Array	Hard
Minimum Operations to Make Array Elements Zero	Hard
Minimum Operations to Make Character Frequencies Equal	Hard
Minimum Operations to Make Elements Within K Subarrays Equal	Hard
Minimum Pair Removal to Sort Array II	Hard
Path Existence Queries in a Graph II	Hard
Permutations IV	Hard
Separate Squares II	Hard
Shortest Matching Substring	Hard
Shortest Path in a Weighted Tree	Hard
Smallest Palindromic Rearrangement II	Hard
Smallest Substring With Identical Characters I	Hard