You're just crazy I would say. Just crystal clear understanding of the most complex algorithm of dsa. Your effort = 100/100, understandability=100/100. Grateful towards you =100/100

I figured out why the balloon came, it was because you made a victory sign with your two fingers while explaining.😄

BEST VIDEO EVER ON KMP SIR 😍

You're just crazy I would say. Just crystal clear understanding of the most complex algorithm of dsa. Your effort = 100/100, understandability=100/100. Grateful towards you =100/100 🙂🙃

I have already watched Neetcode video of kmp, but your version of KMP is best.I liked your video bro , thank you.

The part where you explained the Intuition of KMP working is just out of the world!!

finally learned kmp .clean and clear explanation . thank you so much bro.

The number of times you have sent Broo to ask for matching the pattern , now he is not anymore bro he is telling "jaa khud puchkar aa ". Brooooo🤯

Thank you for the video. Understood everything about kmp.

bhai ive watched at;east 10 15 videos on lps kmp but could'nt get the intuition for some time i could mug up..but forget after some time...this time i got the proper intuition thanks so much

"I wouldn't have said 'bro' this many times in my entire life as you did in this video alone 😂..But really nice explanation ❤"

Best video on kmp Just awesome

nice explanation👍

Good explanation

I want to find O(M) space of LPS array i.e. to use only of pattern length. Where to find it?

btwn z-function and kmp wch one is good?

35:42 iska intution ptaa hai kisiko aisa krne se answer kyu aara?

I couldn't wrap my head around the below line at kzread.info/dash/bejne/eaZhx62LpbqvgcY.html: lps[i] = prev_idx + (s[i] == s[prev_idx] ? 1 : 0); How are you soo sure that if the character at index "i" matches with character at "prev_idx" then we can get the lps of current index by adding "prev_idx" to it ? I mean I agree that characters at index "i" & "prev_idx" match, but we don't have any idea about what character is at index "i-1" and whether it is in the longest suffix matching the prefix. Without this idea, how can we add "prev_idx" ?

Brooo 🤯

Hi, at the example with s = "aabaacaabaaa" the last lps element should be 2 not 0. Am I wrong? In my opinion should be like lps = [0, 1, 0, 1, 2, 0, 1, 2, 3, 4, 5, 2] and not [0, 1, 0, 1, 2, 0, 1, 2, 3, 4, 5, 0]. Timestamp: 9:23

@ARYANMITTAL

5 ай бұрын

Bro, ending character was a ‘d’ and not ‘a’ 🙃, though you are absolutely right, if it would have been ‘a’, lps would have been as you mentioned 🫡

@badrelmazaz

5 ай бұрын

@@ARYANMITTAL Oh I got it, I'm sorry it seemed really an 'a' to me. Thanks for replying.

KMP Game over thankss aryan bhaiya

I am just not getting the intuition behind : If current character doesnt matches the previousindex character then why should we go to its previous index and repeat same process? Unable to understand intuition behind that while loop stuff!

@ARYANMITTAL

5 ай бұрын

I will suggest do Leetcode problem 3036 & 3031 (Write Problem name by Aryan Mittal) you will understand the usecase & importance of this while loop. If still have a confusion, then have a new comment, don’t reply on this comment as for me, it will not be visible, and tell what point you understood intuition and what point things doesn’t make sense, i’ll try replying there ❤️❤️

only me, jise kuch smjh nhi aaya?

Bhai please don't use "bhaiya" word, i think those who are watching your vedio are not your little brother can be your big brother. It feels bad please don't use it.

@Lucifer0872

6 ай бұрын

Don't watch his videos . We love him calling everyone bhaiya

@ok-google-run

6 ай бұрын

he's our sweet bhaiya. bhaiya is ageless. Focus on his explanation rather than the pronouns. I am a girl so should I give him a bash for not calling out in girl pronouns?!

@Spyro-kt8gy

Ай бұрын

You're so ungrateful bro.