Shortest Path

1 problem using this pattern

About this pattern:

A useful algorithmic pattern for solving coding problems efficiently.

Often used with: BFS Graph

Complexity Range

Time Complexity

O(V + E) (1 problem)

Space Complexity

O(V) (1 problem)

Problems Using Shortest Path

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