Number of distinct subsequences | 2 October | POTD | GFG Problem of the Day | C++ | Java | Python.

[@bugsincode]

Like👍 | Share✌✌ | Subscribe▶ Solution Link: github.com/BugsInCodeYT/Problem-Of-The-Day-gfg/tree/main/Number%20of%20distinct%20subsequences%5B2%20October%202023%5D

[@gem13259]

After searching for a well explained gfg potd in english i found you it really helped a lot good explanation thank you

[@letssolve_it]

Thank you bro,After spending 1 hour your vidio give me clear explanation.❤❤

[@bugsincode]

Glad to hear that it helped✌️

[@manwinsingh7381]

Missing your gfg potd tutorials. Start doing that again. Your explanations were so great

[@bugsincode]

Bro.. even I'm not getting much time these days. But I'll definitely continue the series as soon as possible. I hope you understand😊.

[@m.a.luqmaan2100]

akshay anil , placement ready with avinash and puneet kumer iiitd kisi kabhi samaj nahi aaya you gave the best explanation and you also clarified the mod 10e9+7 too great mam thank you please do continue this series for ever

[@bugsincode]

Thanks buddy. I'll definitely continue this series✌️

[@aravindkandan6226]

NIce Explanation....But can u explain line number 19...why is it required to add mod with the difference(i.e. dp[i]-dp[j]) ?

[@bugsincode]

See were doing dp[i]-dp[j]. If dp[j] is greater then we will have negative value. So in order to avoid those negative values, we add "mod" to that value to make sure that if doesn't become negative.

[@jacobb9447]

please improve your audio quality....its very spikey at some places

[@bugsincode]

Ok bro.. I'll definitely fix it.