| 332 | Reconstruct Itinerary | Medium | graph |
| 399 | Evaluate Division | Medium | graph |
| 765 | Couples Holding Hands | Hard | graph |
| 924 | Minimize Malware Spread | Hard | graph |
| 928 | Minimize Malware Spread II | Hard | graph |
| 959 | Regions Cut By Slashes | Medium | graph |
| 990 | Satisfiability of Equality Equations | Medium | graph |
| 1042 | Flower Planting With No Adjacent | Easy | graph |
| 1101 | The Earliest Moment When Everyone Become Friends | Medium | graph |
| 1135 | Connecting Cities With Minimum Cost | Medium | graph |
| 1168 | Optimize Water Distribution in a Village | Hard | graph |
| 1334 | Find the City With the Smallest Number of Neighbors at a Threshold Distance | Medium | graph |
| 1349 | Maximum Students Taking Exam | Hard | graph |
| 1361 | Validate Binary Tree Nodes | Medium | graph |
| 1462 | Course Schedule IV | Medium | graph |
| 1489 | Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | Hard | graph |
| 1557 | Minimum Number of Vertices to Reach All Nodes | Medium | graph |
| 1568 | Minimum Number of Days to Disconnect Island | Medium | graph |
| 1579 | Remove Max Number of Edges to Keep Graph Fully Traversable | Hard | graph |
| 1584 | Min Cost to Connect All Points | Medium | graph |
| 1601 | Maximum Number of Achievable Transfer Requests | Hard | graph |
| 1615 | Maximal Network Rank | Medium | graph |
| 1627 | Graph Connectivity With Threshold | Hard | graph |
| 1631 | Path With Minimum Effort | Medium | graph |
| 1697 | Checking Existence of Edge Length Limited Paths | Hard | graph |
| 1719 | Number Of Ways To Reconstruct A Tree | Hard | graph |
| 1724 | Checking Existence of Edge Length Limited Paths II | Hard | graph |
| 1743 | Restore the Array From Adjacent Pairs | Medium | graph |
| 1761 | Minimum Degree of a Connected Trio in a Graph | Hard | graph |
| 1778 | Shortest Path in a Hidden Grid | Medium | graph |
| 1782 | Count Pairs Of Nodes | Hard | graph |
| 1786 | Number of Restricted Paths From First to Last Node | Medium | graph |
| 1791 | Find Center of Star Graph | Medium | graph |
| 1810 | Minimum Path Cost in a Hidden Grid | Medium | graph |
| 1820 | Maximum Number of Accepted Invitations | Medium | graph |
| 1879 | Minimum XOR Sum of Two Arrays | Hard | graph |
| 1947 | Maximum Compatibility Score Sum | Medium | graph |
| 1971 | Find if Path Exists in Graph | Medium | graph |
| 1976 | Number of Ways to Arrive at Destination | Medium | graph |
| 2076 | Process Restricted Friend Requests | Hard | graph |
| 2077 | Paths in Maze That Lead to Same Room | Medium | graph |
| 2092 | Find All People With Secret | Hard | graph |
| 2093 | Minimum Path Cost in a Hidden Grid | Medium | graph |
| 2097 | Valid Arrangement of Pairs | Medium | graph |
| 2123 | Minimum Operations to Remove Adjacent Ones in Matrix | Hard | graph |
| 2127 | Maximum Employees to Be Invited to a Meeting | Hard | graph |
| 2172 | Maximum AND Sum of Array | Hard | graph |
| 2203 | Minimum Weighted Subgraph With the Required Paths | Medium | graph |
| 2204 | Distance to a Cycle in Undirected Graph | Medium | graph |
| 2242 | Maximum Score of a Node Sequence | Medium | graph |
| 2307 | Check for Contradictions in Equations | Hard | graph |
| 2359 | Find Closest Node to Given Two Nodes | Medium | graph |
| 2360 | Longest Cycle in a Graph | Hard | graph |
| 2392 | Build a Matrix With Conditions | Hard | graph |
| 2473 | Minimum Cost to Buy Apples | Medium | graph |
| 2508 | Add Edges to Make Degrees of All Nodes Even | Hard | graph |
| 2608 | Shortest Cycle in a Graph | Hard | graph |
| 2662 | Minimum Cost of a Path With Special Roads | Medium | graph |
| 2699 | Modify Graph Edge Weights | Medium | graph |
| 2714 | Find Shortest Path with K Hops | Hard | graph |
| 2737 | Find the Closest Marked Node | Medium | graph |
| 2836 | Maximize Value of Function in a Ball Passing Game | Hard | graph |
| 2850 | Minimum Moves to Spread Stones Over Grid | Medium | graph |
| 2876 | Count Visited Nodes in a Directed Graph | Hard | graph |
| 2924 | Find Champion II | Medium | graph |
| 2959 | Number of Possible Sets of Closing Branches | Medium | graph |
| 3108 | Minimum Cost Walk in Weighted Graph | Hard | graph |
| 3112 | Minimum Time to Visit Disappearing Nodes | Medium | graph |
| 3123 | Find Edges in Shortest Paths | Medium | graph |
| 3235 | Check if the Rectangle Corner Is Reachable | Hard | graph |
| 3243 | Shortest Distance After Road Addition Queries I | Medium | graph |
| 3244 | Shortest Distance After Road Addition Queries II | Hard | graph |
| 3265 | Count Almost Equal Pairs I | Medium | graph |
| 3267 | Count Almost Equal Pairs II | Hard | graph |
| 3276 | Select Cells in Grid With Maximum Score | Hard | graph |
| 3310 | Remove Methods From Project | Medium | graph |
| 3341 | Find Minimum Time to Reach Last Room I | Medium | graph |
| 3342 | Find Minimum Time to Reach Last Room II | Medium | graph |
| 3376 | Minimum Time to Break Locks I | Medium | graph |
| 3377 | Digit Operations to Make Two Integers Equal | Medium | graph |
| 3378 | Count Connected Components in LCM Graph | Hard | graph |
| 3383 | Minimum Runes to Add to Cast Spell | Hard | graph |
| 3385 | Minimum Time to Break Locks II | Hard | graph |
| 3387 | Maximize Amount After Two Days of Conversions | Medium | graph |
| 3419 | Minimize the Maximum Edge Weight of Graph | Medium | graph |
| 3435 | Frequencies of Shortest Supersequences | Hard | graph |
| 3481 | Apply Substitutions | Medium | graph |
| 3493 | Properties Graph | Medium | graph |
| 3532 | Path Existence Queries in a Graph I | Medium | graph |
| 3534 | Path Existence Queries in a Graph II | Hard | graph |
| 3536 | Maximum Product of Two Digits | Easy | graph |
| 3547 | Maximum Sum of Edge Values in a Graph | Hard | graph |
| 3594 | Minimum Time to Transport All Individuals | Hard | graph |
| 3600 | Maximize Spanning Tree Stability with Upgrades | Hard | graph |
| 3604 | Minimum Time to Reach Destination in Directed Graph | Medium | graph |
| 3620 | Network Recovery Pathways | Hard | graph |
| 3650 | Minimum Cost Path with Edge Reversals | Medium | graph |
| 3656 | Determine if a Simple Graph Exists | Medium | graph |
| 3660 | Jump Game IX | Medium | graph |
| 3710 | Maximum Partition Factor | Hard | graph |
| 3778 | Minimum Distance Excluding One Maximum Weighted Edge | Medium | graph |
| 3873 | Maximum Points Activated with One Addition | Hard | graph |
| 3887 | Incremental Even-Weighted Cycle Queries | Hard | graph |
| 3910 | Count Connected Subgraphs with Even Node Sum | Hard | graph |
| 3928 | Minimum Cost to Buy Apples II | Hard | graph |
| 3970 | Shortest Path With At Most K Consecutive Identical Characters | Medium | graph |
| 3977 | Minimum Time to Reach Target With Limited Power | Hard | graph |