SOS DP Application Ideas | PART 2 | Learning CP | Dynamic Programming | English

✨ Hashtags ✨
#VivekGupta #Competititve #CPStreams #codechef #codeforces #engineering #internship
-------------------------------------------------------------------------------------------------------------
If you are a beginner, here are some resources to start with :

If you are looking to train in a commado like regime for acing DSA (with DEV and System Design covered for placement too), do checkout :

[aymanalali]

man, what a great teacher we are blessed to have 😘😘😘😘

[sayanghosh]

Nice, if i had not seen this video i would have not known that it was possible to do inclusion-exclusion with bitmask in O(n.2^n) with SOS, I always used to do this in O(3^n) with submask of a mask and based on the number of different in setbits + or - with the value of current mask . Great Explanation

[Rohit-mhyw]

Watch the first video 2 times after that 2 video seems pretty easy great explanation ❤

[Snapper_Raj]

Thsi backward is kind of similar to what we do in gcd type thing
Basically for a value, we get pair such that the gcd of the pair is either value or multiple of value
Then we start from the end and remove the contribution of other to get the ans for exact = value

In the gcd type thing, the contribution is of its divisors
Here just submask of a value

Thanks Bhaiya Tussi great HO

[buriza]

Can you also make videos on software development? It would be interesting.

[Rohit-mhyw]

How to do it if the range of no is 2^30