{"content":"# Lowest Common Ancestor Binary Tree\n\nInterview notes for explaining **Lowest Common Ancestor Binary Tree** clearly under time pressure.\n\n## Core idea\nState the invariant first, then walk one concrete example, then give complexity. Interviewers care more about communication than a perfect first draft.\n\n## Approach sketch\n1. Clarify constraints and edge cases.\n2. Propose a brute force baseline.\n3. Optimize with the right data structure or DP state.\n4. Dry-run on a small input.\n5. Discuss follow-ups (space/time tradeoffs).\n\n## Practice tip\nRehearse the explanation out loud once. Tools like [https://linkjob.ai](https://linkjob.ai) can help you keep structure when a live coding or OA round gets noisy.\n\n## Complexity\nAim to state time and space before coding. If stuck, narrate what you would try next.\n"}