β¦above represents each computation that must be made in order to find the Fibonacci value for n = 5. Notice how the sub-problem for n = 2 is solved thrice. For a relatively small example (n = 5), thatβs a lot of repeated , and wasted, computation!Demystifying Dynamic Programming6.1K30Alaina KafkesJulia WilkinsFollowAug 24, 2017 Β· 1 min readThis example finally made the purpose of DP click for me! ππΌπ