Educational repository focused on classic fundamental algorithms and data structures, implemented idiomatically in Go. Not a production-ready library — rather a quick DSA reference and study notes.

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 ...