L15 - Subarrays DP | Longest Valid Parentheses | TLE | 3D DP | Memoization | Tabulation | LC 32

Описание: Today in Lecture 15 of Subarrays DP, we try to solve LeetCode 32 (HARD). Longest Valid Parentheses problem using 3D Dynamic Programming. The solutions were not going to get accepted but this is a good problem to understand DP optimization. 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/longest...
⮕ 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:03 - Prerequisites (Very Important)
2:33 - Approaching Recursion
13:37 - Recursive Code
16:31 - Recursion Time + Approaching DP
16:44 - Code Memoization + Time Space Discussion
24:04 - 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.