Algorithms, Dynamic Programming, Data Structures, Computer Science, Leetcode.
results for all branches, many of which are overlapping. Our approach stores the results of subproblems, and when encountering overlapping subproblems(in the above image toy(3) and toy(9) are overlapping sub problems), we can reuse the old stored value instead of computing it again. This is dynamic