| 2360 | Longest Cycle in a Graph | Hard |
| 2366 | Minimum Replacements to Sort the Array | Hard |
| 2376 | Count Special Integers | Hard |
| 2382 | Maximum Segment Sum After Removals | Hard |
| 2386 | Find the K-Sum of an Array | Hard |
| 2392 | Build a Matrix With Conditions | Hard |
| 2398 | Maximum Number of Robots Within Budget | Hard |
| 2402 | Meeting Rooms III | Hard |
| 2407 | Longest Increasing Subsequence II | Hard |
| 2412 | Minimum Money Required Before Transactions | Hard |
| 2416 | Sum of Prefix Scores of Strings | Hard |
| 2421 | Number of Good Paths | Hard |
| 2426 | Number of Pairs Satisfying Inequality | Hard |
| 2430 | Maximum Deletions on a String | Hard |
| 2435 | Paths in Matrix Whose Sum Is Divisible by K | Hard |
| 2440 | Create Components With Same Value | Hard |
| 2444 | Count Subarrays With Fixed Bounds | Hard |
| 2448 | Minimum Cost to Make Array Equal | Hard |
| 2449 | Minimum Number of Operations to Make Arrays Similar | Hard |
| 2454 | Next Greater Element IV | Hard |
| 2458 | Height of Binary Tree After Subtree Removal Queries | Hard |
| 2463 | Minimum Total Distance Traveled | Hard |
| 2468 | Split Message Based on Limit | Hard |
| 2472 | Maximum Number of Non-overlapping Palindrome Substrings | Hard |
| 2478 | Number of Beautiful Partitions | Hard |
| 2484 | Count Palindromic Subsequences | Hard |
| 2488 | Count Subarrays With Median K | Hard |
| 2493 | Divide Nodes Into the Maximum Number of Groups | Hard |
| 2499 | Minimum Total Cost to Make Arrays Unequal | Hard |
| 2503 | Maximum Number of Points From Grid Queries | Hard |