Find the Maximum Root-to-Leaf Path Sum in a Binary Tree
Company: Amazon
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: hard
Interview Round: Onsite
Overview: Find the maximum binary-tree root-to-leaf path sum with correct negative-value and single-child handling, a recurrence proof, and path reconstruction options.
Read the full Amazon Software Engineer interview experience this question came from