Count Distinct Subsequences Dynamic Programming | Leetcode Hard Solution

NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. In this video, we discuss the Count Distinct Subsequence problem using dynamic programming. In this problem,

1. You are given a string.
2. You have to print the count of distinct and non-empty subsequences of the given string.
Note - String contains only lowercase letters.

#dp #leetcode #dynamicprogramming

[adityahirwani]

Sir, you have got the talent of teaching, hard problems feel like the easy one. Thank you, Sir!

[Shubham-xsek]

Kafi videos dekha sir, but aapki teaching ka level hi alag hai. Aisa hi content banate rahiye. Subscribed you from 5 accounts.

[kushagrashekhawat]

Great Explanation, I clearly understood everything.
Sir, we could have done this in O(1) space because we don't need the whole DP array only the DP[i-1]. And we can store the value of DP[i-1] in the hash map, instead of storing the index.

[stith_pragya]

Thank You So Much Sumeet sir for this wonderful

[yourbestie]

Sir u explained it so nicely sir, but i think watch time of this video is less bcoz even if we watch half video we will understand evrything😍,
The way u tell the intution superb

[paragroy]

Great video and wonderful explanation.
Superb content!!!

[MK-rvev]

thank you sir your way to explain problem and solution is amazing. thank you so much.

[factswithai]

mene ab se har video pe comment karna hai, "East ho ya west sumeet sir is the best"

[MK-rvev]

now I can solve some problem of DP and Graph. credit goes to you.

[Parth.Deshpande]

sir, aapne bohot mast explain kiya hai !

[PankajKP]

lgta tha kbi smj nhi paunga, ab smj agya ek hi bar me

[chiragjain]

Great Explanation Sir
Thanks alot for such amazing content

[mickyman]

sir ye questions kya weekly basis pr revise kru ?, kyuki iske liye ya iske jaise 1d dp ke liye coding round mai dimaag kaise chl paega, new question aaega toh sir insight kaise banau?

[shubhamagarwal]

Awesome explanation ...
covered all insights deeply

[deepjoypal]

Kya mast samjhya hai maza aa gya thank you so much

[harshitlamba]

Hi, you have explained the solution very well. However, I do have a question: In the string 'abc' or 'abcd', we do not have a substring (or subsequence) 'ac'. Then why do we count it?

[hellorvce]

sir how to handle bigger length string testcases

[rahulranjan]

sir at leetcode (string len <= 2000) taking long type dp array and also even using (dp[i] = ) not work.. means some of testcase goes integer overflow..

[ajayrajput]

Plz make a video on counting the subsequences having product less than k

[dineshteja]

sir whenever i was running this in leetcode platform i was getting error for some test cases for which the string is very large but it is working fine in pepcode platform, could u help me