Shortest Path and Components | Dataford Interview Questions

Problem

Given an undirected unweighted graph with n nodes labeled from 0 to n - 1 and an edge list edges, implement a function that returns two results: the length of the shortest path from start to end, and the number of connected components in the graph. If no path exists from start to end, return -1 for the shortest path length.

Constraints

1 <= n <= 10^5
0 <= edges.length <= 2 * 10^5
0 <= start, end < n
Each edge is a pair [u, v] where 0 <= u, v < n and u != v
The graph is undirected and unweighted

Problem

Constraints

1 <= n <= 10^5
0 <= edges.length <= 2 * 10^5
0 <= start, end < n
Each edge is a pair [u, v] where 0 <= u, v < n and u != v
The graph is undirected and unweighted

Problem

Constraints

1 <= n <= 10^5
0 <= edges.length <= 2 * 10^5
0 <= start, end < n
Each edge is a pair [u, v] where 0 <= u, v < n and u != v
The graph is undirected and unweighted

Problem

Constraints

1 <= n <= 10^5
0 <= edges.length <= 2 * 10^5
0 <= start, end < n
Each edge is a pair [u, v] where 0 <= u, v < n and u != v
The graph is undirected and unweighted