| 207 | Course Schedule | — | Medium | Depth-First SearchBreadth-First SearchGraph | 49% | |
| 210 | Course Schedule II | — | Medium | Depth-First SearchBreadth-First SearchGraph | 53% | |
| 269 | Alien Dictionary | — | Hard | ArrayStringDepth-First Search | 37% | |
| 310 | Minimum Height Trees | — | Medium | Depth-First SearchBreadth-First SearchGraph | 42% | |
| 329 | Longest Increasing Path in a Matrix | — | Hard | ArrayDynamic ProgrammingDepth-First Search | 55% | |
| 802 | Find Eventual Safe States | — | Medium | Depth-First SearchBreadth-First SearchGraph | 68% | |
| 851 | Loud and Rich | — | Medium | ArrayDepth-First SearchGraph | 61% | |
| 913 | Cat and Mouse | — | Hard | MathDynamic ProgrammingGraph | 34% | |
| 1203 | Sort Items by Groups Respecting Dependencies | — | Hard | Depth-First SearchBreadth-First SearchGraph | 66% | |
| 1462 | Course Schedule IV | — | Medium | Depth-First SearchBreadth-First SearchGraph | 60% | |
| 1591 | Strange Printer IIread | — | Hard | ArrayGraphTopological Sort | 60% | |
| 1632 | Rank Transform of a Matrixread | — | Hard | ArrayUnion FindGraph | 41% | |
| 1728 | Cat and Mouse II | — | Hard | ArrayMathDynamic Programming | 40% | |
| 1786 | Number of Restricted Paths From First to Last Node | — | Medium | Dynamic ProgrammingGraphTopological Sort | 40% | |
| 1857 | Largest Color Value in a Directed Graph | — | Hard | Hash TableDynamic ProgrammingGraph | 49% | |
| 1916 | Count Ways to Build Rooms in an Ant Colony | — | Hard | MathDynamic ProgrammingTree | 48% | |
| 1976 | Number of Ways to Arrive at Destination | — | Medium | Dynamic ProgrammingGraphTopological Sort | 38% | |
| 2050 | Parallel Courses III | — | Hard | ArrayDynamic ProgrammingGraph | 67% | |
| 2115 | Find All Possible Recipes from Given Supplies | — | Medium | ArrayHash TableString | 56% | |
| 2127 | Maximum Employees to Be Invited to a Meeting | — | Hard | Depth-First SearchGraphTopological Sort | 62% | |
| 2192 | All Ancestors of a Node in a Directed Acyclic Graph | — | Medium | Depth-First SearchBreadth-First SearchGraph | 62% | |
| 2246 | Longest Path With Different Adjacent Characters | — | Hard | ArrayStringTree | 54% | |
| 2328 | Number of Increasing Paths in a Grid | — | Hard | ArrayDynamic ProgrammingDepth-First Search | 58% | |
| 2360 | Longest Cycle in a Graph | — | Hard | Depth-First SearchBreadth-First SearchGraph | 50% | |
| 2392 | Build a Matrix With Conditions | — | Hard | ArrayGraphTopological Sort | 79% | |
| 2603 | Collect Coins in a Treeread | — | Hard | ArrayTreeGraph | 36% | |
| 3435 | Frequencies of Shortest Supersequences | — | Hard | ArrayStringBit Manipulation | 15% | |
| 3530 | Maximum Profit from Valid Topological Order in DAG | — | Hard | ArrayDynamic ProgrammingBit Manipulation | 26% | |