In this video I explain the solution of a popular coding interview question “Binary Tree Maximum Path Sum” [LeetCode 124].
You can find it here -
[ Ссылка ]
If there is a coding interview problem you would like me to cover, let me know in the comments.
0:00 - Intro
0:10 - Problem Description
1:48 - Examples
2:38 - Solution Explanation
6:43 - Key Insights
7:45 - Code
11:42 - Test Code On Example
17:05 - Small Code Optimization
17:55 - Time & Space Complexity
