Binary Tree Maximum Path Sum has many videos on youtube becasue it is a common FAANG question. I have added the video with a very simple solution and detailed explanation.
problem is present in leetcode as 124. Binary Tree Maximum Path Sum
[ Ссылка ]
Given a non-empty binary tree, find the maximum path sum.
For this problem, a path is defined as any sequence of nodes from some starting node to any node in the tree along the parent-child connections. The path must contain at least one node and does not need to go through the root.
system design: [ Ссылка ]
DS for beginners: [ Ссылка ]
leetcode solutions: [ Ссылка ]
github: [ Ссылка ]
facebook group : [ Ссылка ]
twitter: [ Ссылка ]
