3201 & 3202. Find the maximum Length of Valid Subsequence i & ii | LeetCode Weekly Contest 404

Hi, I am Amit Dhyani. Today, we solve two challenging problems from LeetCode's Weekly Contest 404.

LeetCode 3201: Find the Maximum Length of Valid Subsequence I and LeetCode 3202: Find the Maximum Length of Valid Subsequence II.

These problems are closely related to the classic Longest Increasing Subsequence (LIS) problem, which helps make the concepts easier to understand and solve. I'll guide you through the thought process, breaking down the problems step-by-step, and show you how to apply dynamic programming to find optimized solutions.

Checkout my Segment Tree Playlist:
   • Segment Tree : Basic to LeetCode Hard...  


🌐 Connect with me:
📧 Gmail: [email protected]
💼 LinkedIn:   / amit-dhyani-5164b8138  
📸 Instagram:   / amit.dhyani.1  

#3201 #3202
#leetcode #leetcodeweeklycontest #Coding #Programming #placementprep #jobseekers #cseducation #codingtutorial #leetcodedailychallenge #googleinterview #dynamicprogramming