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

[@tanishgotti3659]

For each row of your time complexity analysis you are keeping V1i constant. But you are not considering the "cnt" part of your pseudo code wherein you will need to iterate over the bucket of each V1i and V2i pair.

[@quyhoaphantruong7453]

The analysis of time complexity part was brilliant !!!

[@nabajyotimajumdar4511]

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

[@simardeepsinghmudhar7065]

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

[@biplavoraon9702]

Very intuitive solution. You have earned a subscriber!

[@sanjai_rs7]

Absolute Brilliance💥

[@Rancha51]

How do you even come up with these solutions ?

[@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.