Graphs
Modelling problems as nodes and edges: BFS/DFS, topological sort, union-find, shortest paths, and spanning trees.
Solved
0/14
1Flood FillDFS · GridEasy2Find if Path Exists in GraphBFS · Union-FindEasy3Find the Town JudgeDegree CountingEasy4Number of IslandsDFS · BFS · GridMedium5Rotting OrangesMulti-source BFS · GridMedium6Course ScheduleTopological Sort · Cycle DetectionMedium7Course Schedule IITopological SortMedium8Number of ProvincesUnion-Find · DFSMedium9Redundant ConnectionUnion-FindMedium10Network Delay TimeDijkstra · Shortest PathMedium11Min Cost to Connect All PointsMinimum Spanning Tree · PrimMedium12Word LadderBFS · Shortest PathHard13Swim in Rising WaterDijkstra · GridHard14Critical Connections in a NetworkTarjan · Bridges · DFSHard