L5.1 - Subsequences DP | Partition Equal Subset Sum | Brute DP | Intuition Building | LeetCode 416

Описание: Today in Part 1 of Lecture 5 of Subsequences DP, we solve LeetCode 416 (MEDIUM). Partition Equal Subset Sum problem using Brute Force 2D DP. We'll be focusing on intuition building on how to tackle such subsets partition problems brute forcly. Learn Recursion ⮕ Memoization ⮕ Tabulation ⮕ Space Optimization and build your DP foundation in Hindi.

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

⮕ Problem Link: https://leetcode.com/problems/partiti...
⮕ Code Link: https://github.com/hiren-j/dsaAffecti...

Welcome back to the ULTIMATE DP SERIES in HINDI | vHiren DP Series
This series is designed to help you master Dynamic Programming for coding interviews. 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
2:27 - Intuition Building
11:00 - Recursive Solution
12:18 - Coding Part + 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.