Intro to Dynamic Programming - Fibonacci Numbers | Theory of Programming

This video explains the basics of Dynamic Programming and how to design DP algorithms by applying Memoisation and Bottom-up approach.

Note - This tutorial doesn't have any code walk-through as the code for writing the Nth Fibonacci number is pretty much the same as the snippet shown in the video.

Special thanks -

[abhishek]

your videos are really easy to understand even complex concepts thank you so much

[codingsingh]

memoisation==top downapproach;
top down =tabulation

[arunm]

Thank you sir, it's really helpful, sub'd. Please upload more dp problems.