Roadmap/Graphs

7 subtopics · 51 problems

Graphs

Work through 7 subtopics covering 51 problems, ordered from foundational to advanced.

51Total problems

0Solved

0Attempted

0%Completion

Introduction to Graphs (Learn)

Graph

Easy

15m

Graph Representation (Learn)

Graph

Easy

15m

Undirected Graph — Adjacency Matrix

Graph · Arrays

Easy

10m

Directed Graph — Adjacency Matrix

Graph · Arrays

Easy

10m

Undirected Graph — Adjacency List

Graph · Hashing

Easy

10m

Directed Graph — Adjacency List

Graph · Hashing

Easy

10m

BFS Traversal

Graph · BFS · Queue

Easy

20m

DFS Traversal

Graph · DFS · Recursion

Easy

20m

Number of Provinces

Graph · DFS · Union Find

Medium

25m

Number Of Islands

+1

Graph · BFS · DFS

Medium

25m

Rotten Oranges

Graph · BFS · Queue

Medium

25m

Flood Fill

Graph · BFS · DFS

Easy

15m

Detect Cycle in Undirected Graph (BFS)

Graph · BFS

Medium

25m

Detect Cycle in Undirected Graph (DFS)

Graph · DFS

Medium

25m

Nearest Zero

Graph · BFS

Medium

25m

'O' Within 'X' Boundary

Graph · DFS · BFS

Medium

30m

Number of Enclaves

Graph · DFS · BFS

Medium

25m

Word Transformation Sequence

+1

Graph · BFS · Hashing

Hard

40m

Number Of Distinct Islands

Graph · DFS · Hashing

Medium

30m

Bipartite Graph — DFS

Graph · DFS · BFS

Medium

25m

Detect Cycle In A Directed Graph

Graph · DFS · Topological Sort

Medium

25m

Topological Sort

Graph · DFS · Topological Sort

Medium

25m

Kahn's Algorithm

Graph · BFS · Topological Sort

Medium

25m

Cycle Detection In DAG Using Kahn's Algorithm

Graph · BFS · Topological Sort

Medium

25m

Task Completion I

Graph · Topological Sort · BFS

Medium

25m

Task Completion II

Graph · Topological Sort · BFS

Medium

30m

Safe Nodes

Graph · Topological Sort · DFS

Medium

30m

Alien Dictionary Sort

Graph · Topological Sort · Strings

Hard

35m

Shortest Path in Undirected Graph

Graph · BFS

Medium

25m

Shortest Path DAG

Graph · Topological Sort · Dynamic Programming

Medium

30m

Dijkstra's Algorithm

Graph · Heap · BFS

Medium

30m

Shortest Distance in Grid

Graph · BFS · Heap

Medium

30m

Minimum Effort Path

Graph · Heap · Binary Search

Medium

30m

Cheapest Flight within K Stops

Graph · Bellman-Ford · Dynamic Programming

Medium

30m

Number of Ways to Arrive at Destination

Graph · Dijkstra · Dynamic Programming

Medium

30m

Minimum Steps to Reach a Target

Graph · BFS

Medium

25m

Bellman-Ford Algorithm

Graph · Dynamic Programming

Medium

30m

Floyd Warshall

Graph · Dynamic Programming

Medium

30m

City With Least Neighbors

Graph · Floyd Warshall

Medium

30m

Minimum Spanning Tree (Learn)

Graph · Greedy

Medium

20m

Prim's Algorithm Implementation

Graph · Heap · Greedy

Medium

30m

Disjoint Sets Implementation

Union Find · Graph

Medium

30m

Kruskal's Algorithm Implementation

Graph · Union Find · Greedy

Medium

30m

Graph Connectivity

Graph · Union Find · DFS

Medium

25m

Gem Removal Challenge

Graph · Union Find

Medium

30m

Merge User Profiles

Graph · Union Find · Hashing

Medium

30m

Number Of Islands II

Graph · Union Find

Hard

40m

Largest Connected Group

Graph · Union Find

Medium

30m

Find Bridges

Graph · DFS

Hard

40m

Articulation Points

Graph · DFS

Hard

40m

Strongly Connected Components

Graph · DFS · Topological Sort

Hard

40m