Skip to content
advanced

Challenge: fewest hops across a graph

Implement this from the stub. Hidden tests grade the behaviour you write, not the comments you leave.

Challenge: Fewest Hops Across a Graph

export function hopsBetween(edges: Array<[string, string]>, from: string, to: string): number {
  // Your implementation here
}
challenge — implement from scratchCtrl+↵ submits · Ctrl+Shift+↵ runsstarter code