Max Path Sum | Project Euler | Dynamic Programming | Bottom Up Construction

Описание: Bottom Up Strategy to figure out the maximum sum yielding path in a tree. In a brute force way, the number of all possible ways is in the exponential order of 2 and for a tree of size 100 levels, it might take years to reach the solution. In the video, we discuss about a clever trick and a systematic bottom up construction to solve the problem in linear time.