| 2040 | Kth Smallest Product of Two Sorted Arrays | ArrayBinary Search | Hard |
| 2045 | Second Minimum Time to Reach Destination | Breadth-First SearchGraphShortest Path | Hard |
| 2050 | Parallel Courses III | ArrayDynamic ProgrammingGraph+1 | Hard |
| 2056 | Number of Valid Move Combinations On Chessboard | ArrayStringBacktracking+1 | Hard |
| 2060 | Check if an Original String Exists Given Two Encoded Strings | StringDynamic Programming | Hard |
| 2065 | Maximum Path Quality of a Graph | ArrayBacktrackingGraph | Hard |
| 2071 | Maximum Number of Tasks You Can Assign | ArrayTwo PointersBinary Search+4 | Hard |
| 2076 | Process Restricted Friend Requests | Union FindGraph | Hard |
| 2081 | Sum of k-Mirror Numbers | MathEnumeration | Hard |
| 2088 | Count Fertile Pyramids in a Land | ArrayDynamic ProgrammingMatrix | Hard |
| 2092 | Find All People With Secret | Depth-First SearchBreadth-First SearchUnion Find+2 | Hard |
| 2097 | Valid Arrangement of Pairs | Depth-First SearchGraphEulerian Circuit | Hard |
| 2102 | Sequentially Ordinal Rank Tracker | DesignHeap (Priority Queue)Data Stream+1 | Hard |
| 2106 | Maximum Fruits Harvested After at Most K Steps | ArrayBinary SearchSliding Window+1 | Hard |
| 2111 | Minimum Operations to Make the Array K-Increasing | ArrayBinary Search | Hard |
| 2117 | Abbreviating the Product of a Range | Math | Hard |
| 2122 | Recover the Original Array | ArrayHash TableTwo Pointers+2 | Hard |
| 2127 | Maximum Employees to Be Invited to a Meeting | Depth-First SearchGraphTopological Sort | Hard |
| 2132 | Stamping the Grid | ArrayGreedyMatrix+1 | Hard |
| 2136 | Earliest Possible Day of Full Bloom | ArrayGreedySorting | Hard |
| 2141 | Maximum Running Time of N Computers | ArrayBinary SearchGreedy+1 | Hard |
| 2147 | Number of Ways to Divide a Long Corridor | MathStringDynamic Programming | Hard |
| 2151 | Maximum Good People Based on Statements | ArrayBacktrackingBit Manipulation+1 | Hard |
| 2156 | Find Substring With Given Hash Value | StringSliding WindowRolling Hash+1 | Hard |
| 2157 | Groups of Strings | StringBit ManipulationUnion Find | Hard |
| 2163 | Minimum Difference in Sums After Removal of Elements | ArrayDynamic ProgrammingHeap (Priority Queue) | Hard |
| 2167 | Minimum Time to Remove All Cars Containing Illegal Goods | StringDynamic Programming | Hard |
| 2172 | Maximum AND Sum of Array | ArrayDynamic ProgrammingBit Manipulation+1 | Hard |
| 2179 | Count Good Triplets in an Array | ArrayBinary SearchDivide and Conquer+4 | Hard |
| 2183 | Count Array Pairs Divisible by K | ArrayMathNumber Theory | Hard |
| 2188 | Minimum Time to Finish the Race | ArrayDynamic Programming | Hard |
| 2193 | Minimum Number of Moves to Make Palindrome | Two PointersStringGreedy+1 | Hard |
| 2197 | Replace Non-Coprime Numbers in Array | ArrayMathStack+1 | Hard |
| 2203 | Minimum Weighted Subgraph With the Required Paths | GraphShortest Path | Hard |
| 2209 | Minimum White Tiles After Covering With Carpets | StringDynamic ProgrammingPrefix Sum | Hard |
| 2213 | Longest Substring of One Repeating Character | ArrayStringSegment Tree+1 | Hard |
| 2218 | Maximum Value of K Coins From Piles | ArrayDynamic ProgrammingPrefix Sum | Hard |
| 2223 | Sum of Scores of Built Strings | StringBinary SearchRolling Hash+3 | Hard |
| 2227 | Encrypt and Decrypt Strings | ArrayHash TableString+2 | Hard |
| 2234 | Maximum Total Beauty of the Gardens | ArrayTwo PointersBinary Search+4 | Hard |
| 2242 | Maximum Score of a Node Sequence | ArrayGraphSorting+1 | Hard |
| 2246 | Longest Path With Different Adjacent Characters | ArrayStringTree+3 | Hard |
| 2251 | Number of Flowers in Full Bloom | ArrayHash TableBinary Search+3 | Hard |
| 2258 | Escape the Spreading Fire | ArrayBinary SearchBreadth-First Search+1 | Hard |
| 2262 | Total Appeal of A String | Hash TableStringDynamic Programming | Hard |
| 2267 | Check if There Is a Valid Parentheses String Path | ArrayDynamic ProgrammingMatrix | Hard |
| 2272 | Substring With Largest Variance | ArrayDynamic Programming | Hard |
| 2276 | Count Integers in Intervals | DesignSegment TreeOrdered Set | Hard |
| 2281 | Sum of Total Strength of Wizards | ArrayStackMonotonic Stack+1 | Hard |
| 2286 | Booking Concert Tickets in Groups | Binary SearchDesignBinary Indexed Tree+1 | Hard |