- Number of islandsMedium✓ Solved2 approaches
- Topological sort of a DAGMedium✓ Solved2 approaches
- Represent a graph; BFS and DFSEasy✓ Solved1 approach
- Detect a cycle — directed and undirectedMedium✓ Solved2 approaches
- Flood fillEasy✓ Solved1 approach
- Clone a graphMedium✓ Solved1 approach
- Shortest path on a grid — rat in a maze, knight moves, snake & ladderMedium✓ Solved1 approach
- Word Ladder (shortest transformation sequence)Hard✓ Solved1 approach
- Dijkstra's shortest pathsMedium✓ Solved1 approach
- Topological sort; job completion times & longest path in a DAGMedium✓ Solved1 approach
- Alien dictionary — order of lettersHard✓ Solved1 approach
- Minimum spanning tree — Kruskal and PrimMedium✓ Solved2 approaches
- Bellman–Ford and detecting a negative cycleMedium✓ Solved1 approach
- Floyd–Warshall (all-pairs shortest paths)Medium✓ Solved1 approach
- Check whether a graph is bipartite / the Two-Clique problemMedium✓ Solved1 approach
- Bridges and articulation pointsHard✓ Solved1 approach
- Strongly connected components (Kosaraju)Hard✓ Solved1 approach
- Graph / m-colouring problemMedium✓ Solved1 approach
- Travelling Salesman Problem (exact)Hard✓ Solved1 approach
- Making wired connections / redundant connection (components)Medium✓ Solved1 approach
- Journey to the Moon (count invalid pairs)Medium✓ Solved1 approach
- Cheapest flights within K stopsMedium✓ Solved1 approach
- Water jug problem (reach a target amount)Medium✓ Solved1 approach
- Minimum edges to reverse to make a path from source to destinationMedium✓ Solved1 approach
- Count triangles in a graphMedium✓ Solved1 approach
- Minimise cash flow among friendsMedium✓ Solved1 approach
- Euler path / circuit — Seven Bridges, Chinese PostmanHard✓ Solved1 approach
- Vertex Cover ProblemHard✓ Solved1 approach
- Oliver and the Game (ancestor check on a rooted tree)Medium✓ Solved1 approach
- Max Area of IslandMedium✓ Solved1 approach
- Pacific Atlantic Water FlowMedium✓ Solved1 approach
- Surrounded RegionsMedium✓ Solved1 approach
- Minimum Height TreesMedium✓ Solved1 approach
- Number of Connected Components in an Undirected GraphMedium✓ Solved2 approaches
- Graph Valid TreeMedium✓ Solved1 approach
- Accounts MergeMedium✓ Solved1 approach
- Number of ProvincesMedium✓ Solved1 approach
- Path With Minimum EffortMedium✓ Solved1 approach