Today in Lecture 1, I am going to teach you the core concepts of 1D Dynamic Programming using the classic Sum of First N Natural Numbers problem.
🌐 Don’t forget to select your language in YouTube settings for better understanding and subtitles!
⮕ Code Link: https://github.com/hiren-j/dsaAffecti...
This series is designed to help you master Dynamic Programming for coding interviews and competitive programming. From beginner to advanced level, this series covers 12 DP Patterns In which we'll be focusing on recursion, memoization, tabulation, space optimization—everything you need to know about DP. Here are the patterns which you'll be learning :-
⮕ 1D DP
⮕ Multi Dimensional DP
⮕ Subarrays DP
⮕ Subsequences DP
⮕ LIS DP
⮕ String DP
⮕ Stocks DP
⮕ Game Theory DP
⮕ Partition DP
⮕ Square Submatrix DP
⮕ Tree DP
⮕ Graph DP
Video Chapters :-
0:00 - Understanding The Problem
0:46 - Brute Force Approach (Iterative)
2:42 - Brute Force Approach (Recursive)
6:15 - Introducing DP To Approach
7:23 - Ways To Do DP
8:41 - Explaining Memoization (Top Down DP)
15:25 - Coding Memoization
17:28 - Time & Space Discussion (Memoization)
19:55 - Explaining Tabulation (Bottom Up DP)
23:31 - Coding Bottom Up + Time & Space Discussion
30:03 - Misconceptions Talk & Providing Logical Tips To Approach DP Problems
📲 Follow Me On
🔹 LinkedIn: / hirenjoshi1630
🔹 GitHub: https://github.com/hiren-j
🔹 Instagram: / cuzvhiren
Intro Music Credits :-
Song: Blue Boi
Music provided by LAKEY INSPIRED
Video Link: • LAKEY INSPIRED - Blue Boi
Outro Music Credits :-
Song: Ikson - New Day (Vlog No Copyright Music)
Music provided by Vlog No Copyright Music.
Music Video: • Ikson - New Day (Vlog No Copyright Music)
🔔 Subscribe, Like & Share For More Series / Videos Like This.