| 1912 | Design Movie Rental System | Hard |
| 1916 | Count Ways to Build Rooms in an Ant Colony | Hard |
| 1923 | Longest Common Subpath | Hard |
| 1928 | Minimum Cost to Reach Destination in Time | Hard |
| 1931 | Painting a Grid With Three Different Colors | Hard |
| 1932 | Merge BSTs to Create Single BST | Hard |
| 1938 | Maximum Genetic Difference Query | Hard |
| 1944 | Number of Visible People in a Queue | Hard |
| 1948 | Delete Duplicate Folders in System | Hard |
| 1955 | Count Number of Special Subsequences | Hard |
| 1960 | Maximum Product of the Length of Two Palindromic Substrings | Hard |
| 1964 | Find the Longest Valid Obstacle Course at Each Position | Hard |
| 1970 | Last Day Where You Can Still Cross | Hard |
| 1977 | Number of Ways to Separate Numbers | Hard |
| 1982 | Find Array Given Subset Sums | Hard |
| 1987 | Number of Unique Good Subsequences | Hard |
| 1994 | The Number of Good Subsets | Hard |
| 1998 | GCD Sort of an Array | Hard |
| 2003 | Smallest Missing Genetic Value in Each Subtree | Hard |
| 2009 | Minimum Number of Operations to Make Array Continuous | Hard |
| 2014 | Longest Subsequence Repeated k Times | Hard |
| 2019 | The Score of Students Solving Math Expression | Hard |
| 2025 | Maximum Number of Ways to Partition an Array | Hard |
| 2030 | Smallest K-Length Subsequence With Occurrences of a Letter | Hard |
| 2035 | Partition Array Into Two Arrays to Minimize Sum Difference | Hard |
| 2040 | Kth Smallest Product of Two Sorted Arrays | Hard |
| 2045 | Second Minimum Time to Reach Destination | Hard |
| 2050 | Parallel Courses III | Hard |
| 2056 | Number of Valid Move Combinations On Chessboard | Hard |
| 2060 | Check if an Original String Exists Given Two Encoded Strings | Hard |