# Binary Tree Maximum Path Sum (Practice 5039): Review Interviewers use this pattern to test whether you can state the invariant before coding. Here is a compact rehearsal note. ## Approach Each node returns its best downward gain; update the global answer with left+right through the node. ```python def max_path_sum(root): best=float('-inf') def gain(n): nonlocal best if not n: return 0 l=max(gain(n.left),0);r=max(gain(n.right),0) best=max(best,n.val+l+r);return n.val+max(l,r) gain(root);return best ``` ## Complexity Linear in the dominant input size for the scan; heap/tree variants add a log factor. ## Interview pitfalls State the invariant out loud, name the complexity, then code. Skipping the invariant is the usual fail mode. ## Practicing out loud Narrate the approach, complexity and one edge case in under a minute. Disclosure: I work on Linkjob AI, a real-time interview assistant. If you want live practice help, see [try it free](https://www.linkjob.ai/).