โ† Amazon questions

Max root to leaf sum

Filed under Amazon

Given a directed acyclic graph (DAG) or tree represented as nodes and edges, find the maximum possible sum along any path from a root node to a 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 Amazon questions

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