3201, 3202. Find the Maximum Length of Valid Subsequence II | | Math | DP | LIS Similar

In this video, I'll talk about how to solve Leetcode 3202. Find the Maximum Length of Valid Subsequence II | 3201. Find the Maximum Length of Valid Subsequence I | Math | DP | LIS Similar

LIS Concept -    • Find the Longest Valid Obstacle Cours...  

Code for top down code (same as what we discussed in video) - https://leetcode.com/problems/find-th...
[and yeah, as we are having i, j, & prevRem] - thus complexity will be O(n*n*k)

Let's Connect:
📱Discord (Join Community) :   / discord  

📝Linkedin:   / aryan-mittal-0077  
📸 Instagram:   / codewitharyanbhai  
💻 Twitter -   / aryan_mittal007  
🤖 Github: https://github.com/aryan-0077

About Me:
I am Aryan Mittal - A Software Engineer in Goldman Sachs, Speaker, Creator & Educator. During my free time, I create programming education content on this channel & also how to use that to grow :)

✨ Timelines✨
0:00 -Bakwas
2:35 - Building up Intuition for Leetcode 3201
7:22 - LC 3201 Explanation
11:22 - Code Explanation
13:16 - Another way to solve LC 3201 (curRem, prevRem, curRem) form
20:16 - LC 3202 Explanation, Code & Dry Run Explample
24:34 - LC 3202 Top-Down approach thinking (Code in Description)
31:06 - Space Optimised O(k) Solution
37:10 - Like thok dena

✨ Hashtags ✨
#programming #Interviews #leetcode #faang #maang #datastructures #algorithms