leetcode 115 Distinct Subsequences

[reassume]

@10:05 you told that if we include the last character ' i ' and then u have removed that ' i ' from S....i didn't get why?

[nagarjunvinukonda]

Your solution dosnt work when run on leetcode in c++. Please check and provide us the code in the link description.

[tusharjaiswal]

at 9:28 is the include and exclude condition vice versa of whar was written?

[nknidhi]

Awesome explanation !! Thanks Lucky :)

[karana]

great explanation, thank you, it may help some people if you fill the DP array in the video itself. Also explain more around how formula of last char equal was achieved. thanks again

[stevejob]

sir apki voice bahut slow hai please improve the voice quality

[amalraj]

i Disliked th video to make
123 Likes 45 Dislike
:> Sry

[maneshwarsingh]

Bro just a friendly suggestion, you explain much better when in Hindi. In this video although you tried your best, explanation was nowhere near to your other videos I've watched.

[rahulbhati]

LITERALLY VERY VERY INTRESTING EXPLANATION. I LIKE IT VERY MUCH SIR.

[reassume]

Explanation was really nice...but still i didn't get why we are doing d[i+1][j+1]=dp[i+1][j] +👉 dp[i][j] 👈 I am not getting this addition of dp[i][j]....
Why are we adding it? I agree that when characters of the two strings match we get more number of distinct ....that is I am clear with the part
👉 d[i+1][j+1] *=* dp[i+1][j] *+* something👈 but why are we adding this dp[i][j]....From what I understand..there should be *1* in place of "something" because we will be having one more distinct subsequence when we get one more subsequence....Please guide me...I have my coding test for a dream company in 2 days.

[akshatjain]

Bro I didn't get the 2nd case..when the last char of the two strings are equal then that means we should look digonally up . Please clarify these things

[anilchaudhry]

u should please come up with recursive equation first