| 1489 | Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | Hard |
| 1559 | Detect Cycles in 2D Grid | Medium |
| 1569 | Number of Ways to Reorder Array to Get Same BST | Hard |
| 1579 | Remove Max Number of Edges to Keep Graph Fully Traversable | Hard |
| 1584 | Min Cost to Connect All Points | Medium |
| 1627 | Graph Connectivity With Threshold | Hard |
| 1631 | Path With Minimum Effort | Medium |
| 1632 | Rank Transform of a Matrix | Hard |
| 1697 | Checking Existence of Edge Length Limited Paths | Hard |
| 1722 | Minimize Hamming Distance After Swap Operations | Medium |
| 1905 | Count Sub Islands | Medium |
| 1970 | Last Day Where You Can Still Cross | Hard |
| 1998 | GCD Sort of an Array | Hard |
| 2003 | Smallest Missing Genetic Value in Each Subtree | Hard |
| 2076 | Process Restricted Friend Requests | Hard |
| 2092 | Find All People With Secret | Hard |
| 2157 | Groups of Strings | Hard |
| 2316 | Count Unreachable Pairs of Nodes in an Undirected Graph | Medium |
| 2334 | Subarray With Elements Greater Than Varying Threshold | Hard |
| 2382 | Maximum Segment Sum After Removals | Hard |
| 2503 | Maximum Number of Points From Grid Queries | Hard |
| 2573 | Find the String with LCP | Hard |
| 2617 | Minimum Number of Visited Cells in a Grid | Hard |
| 2658 | Maximum Number of Fish in a Grid | Medium |
| 2709 | Greatest Common Divisor Traversal | Hard |
| 2812 | Find the Safest Path in a Grid | Medium |