| 1319 | Number of Operations to Make Network Connected | Medium |
| 1334 | Find the City With the Smallest Number of Neighbors at a Threshold Distance | Medium |
| 1361 | Validate Binary Tree Nodes | Medium |
| 1368 | Minimum Cost to Make at Least One Valid Path in a Grid | Hard |
| 1377 | Frog Position After T Seconds | Hard |
| 1462 | Course Schedule IV | Medium |
| 1466 | Reorder Routes to Make All Paths Lead to the City Zero | Medium |
| 1489 | Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | Hard |
| 1494 | Parallel Courses II | Hard |
| 1514 | Path with Maximum Probability | Medium |
| 1557 | Minimum Number of Vertices to Reach All Nodes | Medium |
| 1579 | Remove Max Number of Edges to Keep Graph Fully Traversable | Hard |
| 1591 | Strange Printer II | Hard |
| 1615 | Maximal Network Rank | Medium |
| 1632 | Rank Transform of a Matrix | Hard |
| 1697 | Checking Existence of Edge Length Limited Paths | Hard |
| 1719 | Number Of Ways To Reconstruct A Tree | Hard |
| 1728 | Cat and Mouse II | Hard |
| 1761 | Minimum Degree of a Connected Trio in a Graph | Hard |
| 1782 | Count Pairs Of Nodes | Hard |
| 1786 | Number of Restricted Paths From First to Last Node | Medium |
| 1791 | Find Center of Star Graph | Easy |
| 1857 | Largest Color Value in a Directed Graph | Hard |
| 1916 | Count Ways to Build Rooms in an Ant Colony | Hard |
| 1928 | Minimum Cost to Reach Destination in Time | Hard |
| 1971 | Find if Path Exists in Graph | Easy |
| 1976 | Number of Ways to Arrive at Destination | Medium |
| 2039 | The Time When the Network Becomes Idle | Medium |
| 2045 | Second Minimum Time to Reach Destination | Hard |
| 2050 | Parallel Courses III | Hard |