← Goldman Sachs questions

Max sum path in graph

Filed under Goldman Sachs

Given a directed acyclic graph (DAG) where each node has a value, find the maximum path sum from any root node to any leaf node.

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.