L11.1 - Subsequences DP | Ones and Zeroes | 3D DP | LeetCode 474 | Memoization | Tabulation

Описание: Today in Part 1 of Lecture 11 of Subsequences DP, we solve LeetCode 474 (MEDIUM). Ones and Zeroes problem using 3D Dynamic Programming. Today we will be focusing on brute force to solve the problem.

🌐 Don’t forget to select your language in YouTube settings for better understanding and subtitles!

⮕ Problem Link: https://leetcode.com/problems/ones-an...
⮕ 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
4:50 - How Problem Give Hints To Think Recursive
5:05 - Approaching Recursion
18:37 - Recursive Code
21:12 - Recursion Time + Approaching DP
22:40 - Code Memoization + Time Space Discussion
30:50 - Code Tabulation + Time Space Discussion

📲 Follow Me On
🔹 LinkedIn:   / hirenjoshi1630  
🔹 GitHub: https://github.com/hiren-j
🔹 Instagram:   / cuzvhiren  

Intro Music Credits :-
Song: Blue Boi
Music provided by LAKEY INSPIRED
Music Video:    • LAKEY INSPIRED - Blue Boi  

🔔 Subscribe, Like & Share For More Series / Videos Like This.