← Goldman Sachs questions

Maximum depth from source vertex in undirected graph

Filed under Goldman Sachs

Given an undirected connected graph and a source vertex, find the maximum depth (longest shortest-path distance in terms of edge count) reachable from that source.

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 Goldman Sachs questions

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