01 — problem
Binary Tree Maximum Path Sum — LeetCode #?. Full problem statement, examples, and constraints live at https://leetcode.com/problems/binary-tree-maximum-path-sum. DSAPatterns tracks this problem for pattern coverage and progress tracking.
02 — notes
Full examples and constraints live on the original LeetCode prompt. Use the link in the sidebar when you want the canonical statement.
03 — hints
Start by identifying the core tree traversal - post-order idea that reduces the search space.
If you get stuck, check whether a standard tree traversal - post-order technique applies here.