| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 221 | A* Pathfinding | Hard | Advanced GraphsGraphHeuristic |
| 222 | Hamiltonian Path Finder | Hard | Advanced GraphsGraphBacktracking |
| 223 | Graph Coloring | Hard | Advanced GraphsGraphBacktracking |
| 224 | Euler Path and Circuit | Hard | Advanced GraphsGraphDFS |
| 225 | Warehouse Route Optimizer | Hard | Advanced GraphsGraphWeighted |
| 226 | Traveling Salesman (DP + Bitmask) | Hard | Advanced GraphsGraphDP |
| 227 | Maximum Bipartite Matching | Hard | Advanced GraphsGraphAugmenting Path |
| 228 | Minimum Cut (Stoer-Wagner) | Hard | Advanced GraphsGraphMin-Cut |
| 229 | Centroid Decomposition | Hard | Advanced GraphsTreeDecomposition |
| 230 | Heavy-Light Decomposition | Hard | Advanced GraphsTreeSegment Tree |
| 231 | Optimal Paragraph Formatting | Hard | Advanced DPDPString |
| 232 | Glass Pyramid Water Flow | Hard | Advanced DPDPSimulation |
| 233 | Optimal BST Construction | Hard | Advanced DPDPBST |
| 234 | Digit DP Counter | Hard | Advanced DPDPDigits |
| 235 | DP on Trees | Hard | Advanced DPDPTree |
| 236 | Bitmask DP Scheduler | Hard | Advanced DPDPBitmask |
| 237 | Playlist Shuffle Validator | Hard | Advanced DPDPString |
| 238 | Glob Pattern File Matcher | Hard | Advanced DPDPString |
| 239 | Optimal Matrix Game | Hard | Advanced DPDPGame Theory |
| 240 | Minimum Cost String Partition | Hard | Advanced DPDPString |