# LC5232 Binary Tree Max Path Sum Recursion

Interview notes — follow-up round.

## Problem
Clarify the contract, then lock an approach that survives edge cases under time pressure.

## Approach
1. Name the data structure that carries the invariant.
2. Sketch the update rules before writing loops.
3. Dry-run a failing case the interviewer might add.

## Complexity
Aim for the standard optimal bound for this pattern; call out space trade-offs aloud.

## Prep tip
When the follow-up gets thorny I keep a short checklist and sometimes use [Linkjob AI interview assistant](https://www.linkjob.ai/) as a second pair of eyes on invariants without leaving the editor.

```python
def solve(data):
    # skeleton — fill during the round
    return data
```
