3404. Count Special Subsequences | HashMap | GCD | Pattern Identification

[@ARYANMITTAL]

Never do this mistake in your OAs - kzbin.infoRCJwPU619g4?feature=share Q4 - kzbin.info/www/bejne/h4Guqodojqyhfrs

[@aryavyadav9345]

Great explanation. This was indeed a hard question.

[@monsuruokuniyi1234]

It's funny. I just realized I wasn't subscribed even though I've been watching your videos for a while now. Subscribed now and liked. I loved this intuition. By the way, "Maqsad". I had to browse what it means. Nigerian guy here, you may force me to learn Urdu

[@AvradipDas]

Amazing Explanation. You made it pretty easy to understand. Thanks. The key could also be a Pair of Integers.

[@dhruvrawatt9]

Very well explained and question was very intuitive

[@JeetuKumar-wd1uw]

why dp is not working here

[@ajayc815]

big fan of your work 🥰🥰🥰🥰🥰

[@ARYANMITTAL]

Thank you so much broooo 😀

[@amardeep7714]

this ques comes in google just 2 months back in OA.

[@nitinjha4863]

Why is my DP approach giving TLE? class Solution { unordered_map memo; bool check(vector& nums, string& index) { int p = index[0] - '0'; int q = index[1] - '0'; int r = index[2] - '0'; int s = index[3] - '0'; if (q - p

[@anujnagpure9113]

because the solution is taking much time😌

[@surajpatra6779]

@ARYANMITTAL why dp didn't work here ?