Dynamic Programming Introduction - Nth Fibonacci number using DP | 1D

Dynamic programming introduction.
In this video, I tried to explain why we need dynamic programming using a simple example of the count number of Hens and eggs, I tried to explain why Dynamic programming is used here to optimize the problem.
In the later part of the video, I used array memorization to quickly calculate the nth element of the Fibonacci series.

Timestamps:
00:00 The problem
01:47 Trying to find out the solution
06:28 Fibonacci series solution
11:12 Coding recursive approach
13:42 DP magic
.
.
The purpose was to give an intuition about dp. Like if you find it helpful.
#Dyanmic #Programming