I went through lot of solution videos. Yours is so easy to understand . Keep up the great work :)
@ShuangyiHu
16 күн бұрын
Thank you for the very clear explanation!
@jamjam3448
4 ай бұрын
wowwww. Finallyyyy. I have understood this! Thanks a million!
@NiteenChougula-fs9ij
Жыл бұрын
I've been searching for quality DSA lectures on KZitem, and I'm delighted to have found excellent your channel. I'm eager to watch your videos and deepen my understanding of DSA. Thank you for clear and quality video.
@nikoo28
Жыл бұрын
Thank you so much Niteen for being a member and supporting my channel. It really motivates me to keep working hard and bringing out the best. Remember that as a member, you do get priority reply to comments and queries. :)
@jatinkumar4410
5 ай бұрын
Amazing explanation 🙌
@juniorferreira1358
Жыл бұрын
Thank you very much! The information provided was easy to comprehend.
@ahmedtremo
8 ай бұрын
Great explanation, Thanks!
@deepakkumar13204
10 ай бұрын
Thank you bhaiya you are explain very well like striver ।। Are you preparing for any company..
@samridhshubham8109
Жыл бұрын
Absolutely perfect
@unemployedcse3514
14 күн бұрын
awesome ❤
@vyshakkriss7765
Жыл бұрын
I am new to dynamic programming! Good video! Keep making such videos. Although i did not understand it completely, I got a new idea on how to work on problems rather than going straight to brute force methods! Thanks
@nikoo28
Жыл бұрын
What part did you face a problem with?? I can help
@joyantamitra8186
9 ай бұрын
How do you know, you have to attack this problem in this way at the first glance?
@nikoo28
9 ай бұрын
The more you practice, the more patterns you will start to observe. No shortcut my friend :)
@aalialokhandwala8950
Жыл бұрын
can you tell me that while initialization of matrix, why are we traversing from the 1st index and not 0?
@nikoo28
11 ай бұрын
the first row and column will all be zeroes
@sobitregmi31
Жыл бұрын
Can you please make video on word break and equal sum partition problem
@nikoo28
Жыл бұрын
Those are in my list.
@AyushSharma-tj1kp
2 ай бұрын
why did we compare string at i-1 and j-1 ??
@avengersshorts5949
Ай бұрын
To check whether they are same characters or not?
@avengersshorts5949
Ай бұрын
19:59 In the first condition both a are equal at i=1 and j=1 so the string index starts from 0 the first character in word1 is a at index 0 so we need to reduce the i and j by minus 1 Hope you understand
@shaistakhan9048
Жыл бұрын
Thank you!!!!!! Love your Teaching style
@RomanHaivaronski
Жыл бұрын
What is the complexity of this solution? Is it O(n) + O(n) + O(n^2)?
@nikoo28
11 ай бұрын
I explain it at 20:56
@himajap2446
Жыл бұрын
Can someone let me know why do we initialize dp with length (m+1, n+1), why we have to consider empty char at begging of the appraoch?
@nikoo28
Жыл бұрын
Because empty character is also a valid test case
@nikoo28
Жыл бұрын
If you have an input like this str1 = “abcd” str2 = “” This is a perfectly valid test case and it’s answer will be 4.
@SHADOW_736
Жыл бұрын
@@nikoo28o
@itjustworks4824
5 ай бұрын
u explained xactly how its to be done not just filling table
@k.k.harjeeth5422
Жыл бұрын
Lucid !
@shaistakhan9048
Жыл бұрын
waiting for more videos on strings
@xxxmin0uxxx858
Жыл бұрын
nikil, thank you so much my brother , a big fan from algeria
Пікірлер: 35