AppliedAIPrep logoAppliedAI/Prep
← Coding & DSA / 86
hardMetaGoogleAmazon

Find the maximum path sum in a binary tree, where a path may start and end anywhere.

Negative subtrees, a path that bends through any node, and a return value that differs from the answer you track: this problem packs three traps into one DFS. Here is the clean O(n) solution and the reasoning that survives follow-ups.

Updated Aug 2026 · Grounded in real Applied AI Engineer interview loops and written to a senior-engineer editorial bar.

Negative subtrees, a path that bends through any node, and a return value that differs from the answer you track: this problem packs three traps into one DFS. Here is the clean O(n) solution and the reasoning that survives follow-ups.

Unlock the other 750 answers · ₹2,000 / $25Your progress and mastery stay saved · 6 months · one payment · no auto-renew
UP NEXT ON YOUR JOURNEY
Next in this trackFind the next greater element for each item in an array using a monotonic stack.Next in this trackFind all unique triplets in an array that sum to zero (3Sum).Next in this trackMerge all overlapping intervals and explain the sort-then-sweep line technique.
DISCUSSION · 0

No comments yet — be the first to share your approach.