Graph

2 problems using this pattern

About this pattern:

Problems involving vertices, edges, and relationships between entities.

Often used with: BFS DFS Shortest Path Union Find

Complexity Range

Time Complexity

O(V + E) (2 problems)

Space Complexity

O(V) (2 problems)

Problems Using Graph

Number of Connected Components

Count connected components using DFS traversal.

Medium LeetCode
Time: O(V + E)
Space: O(V)
Example: n=5, edges=[[0,1],[1,2],[3,4]] → 2
Graph DFS Union Find
View Solution →

Shortest Path in Unweighted Graph

Find shortest distances from starting node using BFS.

Medium LeetCode
Time: O(V + E)
Space: O(V)
Example: edges=[[0,1],[1,2],[2,3]], start=0 → {0=>0, 1=>1, 2=>2, 3=>3}
Graph BFS Shortest Path
View Solution →
← Back to All Patterns
View All Categories