| 2290 | Minimum Obstacle Removal to Reach Corner | ArrayBreadth-First SearchGraph+3 | Hard |
| 2296 | Design a Text Editor | Linked ListStringStack+3 | Hard |
| 2301 | Match Substring After Replacement | ArrayHash TableString+1 | Hard |
| 2302 | Count Subarrays With Score Less Than K | ArrayBinary SearchSliding Window+1 | Hard |
| 2306 | Naming a Company | ArrayHash TableString+2 | Hard |
| 2312 | Selling Pieces of Wood | ArrayDynamic ProgrammingMemoization | Hard |
| 2318 | Number of Distinct Roll Sequences | Dynamic ProgrammingMemoization | Hard |
| 2321 | Maximum Score Of Spliced Array | ArrayDynamic Programming | Hard |
| 2322 | Minimum Score After Removals on a Tree | ArrayBit ManipulationTree+1 | Hard |
| 2328 | Number of Increasing Paths in a Grid | ArrayDynamic ProgrammingDepth-First Search+5 | Hard |
| 2334 | Subarray With Elements Greater Than Varying Threshold | ArrayStackUnion Find+1 | Hard |
| 2338 | Count the Number of Ideal Arrays | MathDynamic ProgrammingCombinatorics+1 | Hard |
| 2344 | Minimum Deletions to Make Array Divisible | ArrayMathSorting+2 | Hard |
| 2350 | Shortest Impossible Sequence of Rolls | ArrayHash TableGreedy | Hard |
| 2354 | Number of Excellent Pairs | ArrayHash TableBinary Search+1 | Hard |
| 2360 | Longest Cycle in a Graph | Depth-First SearchBreadth-First SearchGraph+1 | Hard |
| 2366 | Minimum Replacements to Sort the Array | ArrayMathGreedy | Hard |
| 2376 | Count Special Integers | MathDynamic Programming | Hard |
| 2382 | Maximum Segment Sum After Removals | ArrayUnion FindPrefix Sum+1 | Hard |
| 2386 | Find the K-Sum of an Array | ArraySortingHeap (Priority Queue) | Hard |
| 2392 | Build a Matrix With Conditions | ArrayGraphTopological Sort+1 | Hard |
| 2398 | Maximum Number of Robots Within Budget | ArrayBinary SearchQueue+4 | Hard |
| 2402 | Meeting Rooms III | ArrayHash TableSorting+2 | Hard |
| 2407 | Longest Increasing Subsequence II | ArrayDivide and ConquerDynamic Programming+4 | Hard |
| 2412 | Minimum Money Required Before Transactions | ArrayGreedySorting | Hard |
| 2416 | Sum of Prefix Scores of Strings | ArrayStringTrie+1 | Hard |
| 2421 | Number of Good Paths | ArrayHash TableTree+3 | Hard |
| 2426 | Number of Pairs Satisfying Inequality | ArrayBinary SearchDivide and Conquer+4 | Hard |
| 2430 | Maximum Deletions on a String | StringDynamic ProgrammingRolling Hash+2 | Hard |
| 2435 | Paths in Matrix Whose Sum Is Divisible by K | ArrayDynamic ProgrammingMatrix | Hard |
| 2440 | Create Components With Same Value | ArrayMathTree+2 | Hard |
| 2444 | Count Subarrays With Fixed Bounds | ArrayQueueSliding Window+1 | Hard |
| 2448 | Minimum Cost to Make Array Equal | ArrayBinary SearchGreedy+2 | Hard |
| 2449 | Minimum Number of Operations to Make Arrays Similar | ArrayGreedySorting | Hard |
| 2454 | Next Greater Element IV | ArrayBinary SearchStack+3 | Hard |
| 2458 | Height of Binary Tree After Subtree Removal Queries | ArrayTreeDepth-First Search+2 | Hard |
| 2463 | Minimum Total Distance Traveled | ArrayDynamic ProgrammingSorting | Hard |
| 2468 | Split Message Based on Limit | StringBinary SearchEnumeration | Hard |
| 2472 | Maximum Number of Non-overlapping Palindrome Substrings | Two PointersStringDynamic Programming+1 | Hard |
| 2478 | Number of Beautiful Partitions | StringDynamic Programming | Hard |
| 2484 | Count Palindromic Subsequences | StringDynamic Programming | Hard |
| 2488 | Count Subarrays With Median K | ArrayHash TablePrefix Sum | Hard |
| 2493 | Divide Nodes Into the Maximum Number of Groups | Depth-First SearchBreadth-First SearchUnion Find+1 | Hard |
| 2499 | Minimum Total Cost to Make Arrays Unequal | ArrayHash TableGreedy+1 | Hard |
| 2503 | Maximum Number of Points From Grid Queries | ArrayTwo PointersBreadth-First Search+4 | Hard |
| 2508 | Add Edges to Make Degrees of All Nodes Even | Hash TableGraph | Hard |
| 2509 | Cycle Length Queries in a Tree | ArrayTreeBinary Tree | Hard |
| 2514 | Count Anagrams | Hash TableMathString+2 | Hard |
| 2518 | Number of Great Partitions | ArrayDynamic Programming | Hard |
| 2528 | Maximize the Minimum Powered City | ArrayBinary SearchGreedy+3 | Hard |