Binary Tree Max Path Sum (LeetCode Day 29)

Given a binary tree with values in nodes, find a path with the maximum sum of values. This coding interview problem is quite similar to other tree problems like "find height" or subtrees or any kind of dp on trees - it's just about thinking what should be returned by DFS.
Leetcode April Challenge - https://leetcode.com/explore/featured/card/30-day-leetcoding-challenge/

Subscribe for more educational videos on algorithms, coding interviews and competitive programming.

- Github repository: https://github.com/Errichto/youtube
- Live streams on 2nd YT channel and on Twitch: https://www.youtube.com/errichto2 & https://www.twitch.tv/errichto
- FB and Twitter: https://www.facebook.com/errichto & https://twitter.com/errichto
- Frequently Asked Questions: https://github.com/Errichto/youtube/wiki/FAQ

#Coding #Programming

Видео Binary Tree Max Path Sum (LeetCode Day 29) канала Errichto Algorithms