Binary Tree Maximum Path Sum (LeetCode 124)
HardLeetCode 124 · Height, Depth & Diameter · Google, Amazon +22 · 26:35Binary Tree Maximum Path Sum - (Google, Meta, Amazon, Flipkart) : Explanation ➕ Live CodingMy notes
Sign in to keep private notes on every station, with video timestamps.
Pause here and write your approach in two lines. Compare it with MIK's when the video ends.
Sign in to write your approach →About this video
Video solution for LeetCode 124 Binary Tree Maximum Path Sum by codestorywithMIK: Trees, Hard. Topics: Dynamic Programming, Tree, Depth-First Search, Binary Tree. Watch the explanation, then check the code and solve it on LeetCode.
- Difficulty
- hard
- Topics
- Dynamic Programming, Tree, Depth-First Search, Binary Tree, DP on Trees
- Patterns
- Height, Depth & Diameter, Root-to-Leaf Paths
- Chapter
- Trees
- Duration
- 26:35
Related problems
- Path Sum II (LeetCode 113)
- Path Sum - (Amazon, Microsoft, Accolite, Adobe...) : Explanation + Live Coding 🧑🏻💻👩🏻💻 (LeetCode 112)
- Sum Root to Leaf Numbers (LeetCode 129)
- Minimum Depth of Binary Tree (LeetCode 111)
- Paths from root with a specified sum
- Pseudo-Palindromic Paths in a Binary Tree (LeetCode 1457)
- Diameter of Binary Tree (LeetCode 543)
- Height of Binary Tree After Subtree Removal Queries (LeetCode 2458)