@@nikoo28 same opinion bro i have tried several channels but you are god in these... even though am using python am able to understand the algoritham from u and able to code from that
hello sir would you please make a video on subsequence using recursion for example if we have an arr = [1,2,3] output = ans = [[],1,2,3,[1,2][2,3],[1,3][1,2,3]]
In the two pointer approach, I did not understand one thing the ordering also has to be checked in a subsequence which is missing for the problem in the testcases, for instance here s = "acg" and t = "ahbgdc", they are considering s as a subsequence of t which should not be so, as the ordering is not maintained, although all elements are present from s in t. Please explain this once, because in your code as well the ordering part is not covered.
Yes that was my query where are we taking care of this ordering as well in code even though acg is not a subsequence of ahbgdc, are we really taking care of it in code? If so how?
You are a legend, please keep making these, genuinely the only youtube I can follow along and understand. Keep going!!!
will do
@@nikoo28 same opinion bro i have tried several channels but you are god in these... even though am using python am able to understand the algoritham from u and able to code from that
This Channel is a pure Gold ..... Found this few days back and really helpful
thanks for the lovely feedback :)
great work, very nicely explained.
great work .Thanks for solving the problem from scratch
Happy to help
Cool explanation. Thanks!
hey nikhil , all text based solution links are navigating to random page , can u pls check on that , it was working fine earlier
hello sir would you please make a video on subsequence using recursion for example if we have an arr = [1,2,3] output = ans = [[],1,2,3,[1,2][2,3],[1,3][1,2,3]]
will do
Thanks
could u do the follow up question?
Yes I will
In the two pointer approach, I did not understand one thing the ordering also has to be checked in a subsequence which is missing for the problem in the testcases, for instance here s = "acg" and t = "ahbgdc", they are considering s as a subsequence of t which should not be so, as the ordering is not maintained, although all elements are present from s in t. Please explain this once, because in your code as well the ordering part is not covered.
acg is NOT a subsequence of abhgdc, the ordering of character changes
Yes that was my query where are we taking care of this ordering as well in code even though acg is not a subsequence of ahbgdc, are we really taking care of it in code? If so how?
@@anutoshghosh7893 in the last return statement. It will return a false with the test case you mentioned.
let sunsequence=(str1,str2)=>{
let fam=[]
for(let i = 0; i
could u do the follow up question?
will do that soon, it got added recently after I posted the video.