3202. Find the Maximum Length of Valid Subsequence II | Weekly Leetcode 404

Segment Tree Series - bit.ly/segment-trees
*************************************************
Contest Link - leetcode.com/contest/weekly-c...
Problem Link - leetcode.com/contest/weekly-c...
Solution - leetcode.com/problems/find-th...
*************************************************
Timestamps -
00:00 - Agenda
00:39 - Problem Description
02:29 - Brute force solution
02:55 - One simple observation
06:45 - Brute force solution for Alternating numbers
09:30 - Optimising the solution
11:00 - Pseudo code & Time Complexity
18:38 - Code Walkthrough
*************************************************
Interview Experiences Playlists -
Microsoft - • Microsoft Interview Qu...
Amazon - • Amazon Interview Quest...
D.E.Shaw - • D.E.Shaw Interview Que...
Linkedin - • Linkedin Interview Que...
Facebook - • Facebook (Meta) Interv...
*********************************************************************
Please show support and subscribe if you find the content useful.

[@biplavoraon9702]

Very intuitive solution. You have earned a subscriber!

[@quyhoaphantruong7453]

The analysis of time complexity part was brilliant !!!

[@nabajyotimajumdar4511]

Such a nice solution! I was kinda confused after seeing the dp solution

[@sanjai_rs7]

Absolute Brilliance💥

[@AnandKumar-kz3ls]

one doubt ( a + b ) %k == (a%k + b%k)%k can you please explain why you're eliminating %k here

[@atharvakj]

it will get eliminated from LHS and RHS.

[@simardeepsinghmudhar7065]

Thank you for the curated Segment Tree word document, will follow and practice from it.