nice explanation

@letspracticetogether

2 жыл бұрын

Thanks :-) keep coding

bro POTD thoda jaldi banaya karo

@letspracticetogether

2 жыл бұрын

bro mai jan bujh ke late se dalta hun taki sab koi pehle khud se try kre, our ultimate goal is to learn bas yahi wajah se ❣️ keep coding

Thanks brother for such a great explanation!!!!!!!!!!!.Keep uploading...

@letspracticetogether

2 жыл бұрын

Thank you :-) keep coding

can you make a recursion tree for this problem?

Great Effort ! Keep going !

@letspracticetogether

2 жыл бұрын

Thanks :-) keep coding

Thanks for such a great video, Two questions what's the intuition behind taking the index of the character in t, and why do we then start our next call from k + 1?

@amanmishra5409

11 ай бұрын

t's index, we are taking so that we get the index of char in t which is equal to char in s and because of the property of subsequence we only consider char which is after the current character that's why we are increasing k with i in the second call

@amanmishra5409

11 ай бұрын

we need to check each char of s with every char of t and if we are getting char that is common in both then we have 2 options whether we take it (s,t,i+1,k+1)[we are increasing our count by 1] or not(s,t,i+1,j)

Can you explain about base case how you write that, reasoning behind that

@letspracticetogether

2 жыл бұрын

watch at 4.40 , normally agar hmlog kisi string/tree pe recursion use krte hai to hmlog ka focus hona chahye ki max ye kahan tak ja sakta hai like tree me leaf node tak chala gaya uske niche NULL isliye wahi hamlog ka base condition ban jata hai, similarly yahan hamara string me first string max length 500 ka hi ho sakta hai (according to Constraints) isliye koi v value le lo >500 , aur string 't' ke liye according to question hmlog ne liya hai, yahan for being uncommon shortest length kya ho skta hai 1, isliye hmlog ne 1 return kiya hai, i hope now its clear :-)

Bro today's problem of graph : assignment problem

yarrr merko fast lagta hai aapka pdhaya but yess you trying very hard >>>>> KUDOS to you brother

@letspracticetogether

2 жыл бұрын

:-P will try to explain slowly, keep coding