โ† Amazon questions

Nodes at distance less than k in a graph

Filed under Amazon

Given an undirected graph and a starting node (or set of nodes), return all nodes reachable within a distance of k edges.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Amazon questions

Collected from public candidate posts and coding forums. Updated Nov 2026.