Practicing dynamic programming questions.
To start with, watching a tutorial on Dynamic Programming link
- Solved a basic Fibonacci Problem using memoization that benefits in outputing fib(larger_numbers) for eg. fib(50). It becomes quick. Without memoization it just takes a lot of time. With memoization the time complexity is O(n) and without it is O(2^n) which is a huge difference.