KMP Algorithm || LPS Array Intuition || Pattern Searching

Here I cover the LPS array working and intuition in KMP algorithm.

[@chuckmcgill6673]

Finally after 4 hours I am able to understand lps[len-1], thank you.

[@Timolate]

3:50 is exactly what I am looking for, and not explained so clearly in other videos. Thank you for the clear explanation.

[@pro3757]

Spent hours looking up resources on this topic because of that single line.
Even the nptel guys did not bother explaining the "why". Good job bro. Thank you! ❤

[@ujjvalsharma5055]

Great explanation. You deserve more views.

[@aryamansingh1879]

watched 2-3 videos on kmp, but all of them were missing this "why" of doing something. great explanation.

[@himanshutripathi6323]

Thank you!

[@virajkapurkar2463]

Great!!! Keep up the good work

[@RAHULYADAV-zr5fq]

Great!!

[@ThanujaDil]

Finally understood that line. Thanks.

[@LucaS-ri3zq]

u are a fucking legend

[@piyushaggarwal9484]

Good explaination

[@douglas5260]

Thanks!!!

[@wtfun5465]

very good and short explanation

[@nitilpoddar]

yahi toh chahiye tha

[@ThisisCuriousclue]

hey!! nice>>>
btw whats the time complexity of it?

[@deepakjadli_47]

1 ques kya hum else wale part me lps[ ] array me ye bhi to kr skte hai
else{
len = lps[ 0 ];
lps[ i ] = 0;
i++;
}
please ans anyone