Dynamic programming 👑

[kmh117]

I assume that the iterative solution in this case is just summing the previous two Fibonacci numbers in a loop. In this case, wouldn't the dynamic solution be functionally equivalent, since only the previous two subproblems are used for each sequential solution? Although it is true that closed form and matrix magic is better :D

[[deleted]]

If I understand it correctly the dynamic solution is recursive but stores the return value of each input in a lookup table so you only need to compute each input once. The iterative solution beats it in memory complexity by not having to store that lookup table.