Lecture 42: KMP Algorithm || Longest Prefix Suffix

[@CoderArmy9]

Concept Chamka ki nahi? Before Jumping to the solution, ek baar 15-20 minute baith ke, khud solve karne ki koshish karna, it will become easy for you. at 1:00:53 pre =2, so it must be at index 2 not at 4, just small correction at last

[@akashkewat1219]

Yes bhaiya , concepts shined like a diamond💎

[@kartik5134]

chamak gaya bhaiya

[@NajmGameplay]

you are the one bro

[@AayushDubey_007]

Chamka 🤩

[@sauravrajpoot6518]

Yess 🎉

[@manish_kumar_iitg]

4:45 Brute Force Approach :- int n = s.length(); int maxLen = 0; // Iterate over the length of the prefix and suffix for (int len = 1; len < n; ++len) { string prefix; for(int i = 0; i< len; i++){ prefix.push_back(s[i]); } string suffix; for(int i = n-len; i < n; i++){ suffix.push_back(s[i]); } if (prefix == suffix) { maxLen = len; } } return maxLen;

[@abhinandantiwari9944]

❤

[@manpatel9157]

Bhaiya mza hi aa gaya... I've seen 4-5 videos for this topic, but unable to understand. Lekin jab aapka video dekha to sab chamak gaya...🤩🙏

[@manoharmanu9240]

The way you picked up the right examples to explain the tricky part is commendable. Great going brother👏👏

[@divyanshsharma673]

I couldn't understand this algorithm at first when I watched, but after some time, when I'm back again... its fixed in my head. Thank you sir !

[@priyaanshusoni]

The best & most underrated DSA course on KZbin far better than Paid courses out there in the market ! THANK YOU

[@nownow1025]

you are very hardworking bhaiya. can be seen clearly from your intial submissions.Thank you for teaching us.grateful to u

[@varunprajapati5838]

shukriya mere bhai. Mushkil tha concept, behadh asaan bana diya bhai tumne. Bhhout shukriya😊😊🙏🙏

[@kodurisaivishnu4916]

one and only the best Explanation on youtube...

[@prajitbanerjee8226]

Your understanding is crystal clear thats why you are able to explain this flawlessly..hats off to your dedication!!!

[@GaneshBhutekar-nu1gd]

lecture is 1 hour, but I spent 4 hours. Then I cleared the concept of LPS. Thank you, sir.

[@alijuttjut8380]

but i spent 7hrs with notes

[@prabinaswain3267]

After seeing a lot video of KMT , This video gives crystal clear concept how and why we are able to reduce the Time complexity of finding prefix=suffix

[@MO-fg2cm]

9:10 space complexity is O(2N) same as O(N)

[@rishabhshenoy3258]

But bro string ka array so o N2 na??

[@joydeep-halder]

7:30 Time complexity to get all prefixes or suffixes will be O(n) instead of O(n^2) bhaiya. To compare all the strings it will take O(n * n). So, at the end, overall time complexity is O(n^2)

[@saketjaiswalSJ]

bhai bahut baar dekha loop mein samjh aaa gya explanation god level bhai really god level

[@Playlist-y1f]

Wohoo!!!!!! amazing explanation.

[@ayushsinha1696]

Crazy video. Had to try a lot of examples to understand it clearly. thanks for the awesome explaination

[@Roman_Baloch]

Ak dum chamak gya . Love your teaching method . LOVE FROM PAKISTAN

[@nitinkumar5974]

God level explanation...understood everything!

[@nitinkumar5974]

have subscribed you, next level explanation. This is a single precious video on whole youtube for KMP right now when I am watching this. Worth watching this 1 hour long video. had watched it at 1.5x speed.

[@janaSdj]

Finally understand LPS after wasting so many times in other garbage videos. Thank you bro...

[@engineershb]

best bhai best kmal ho qsm sy

[@pranavarora724]

Was struggling how to build prefix table Best video so far on building prefix table and KMP algo

[@riyaraj5720]

Awesome explanation sir! So much better than any paid course. Thank you thank you thank you!!!

[@i_am_groot3787]

best video on yt .. best explaination

[@MohitG7701]

very good explanation of such a complex logic. Nowhere find this kind of explanation. Thanks for making this video. 🙏

[@neerajchopra2758]

no one beat rohit sir 🔥

[@_abhi2003_]

Literally one of the best lecture bhaiya...aLWAYS get motivated by seeing u

[@pankajkashyap2892]

chamka diya bhaiya best dsa course in history ever for logic building

[@apurvapat3524]

Best Explanation i have ever seen. Hats off

[@vivekpaliwal1876]

Time liya but ache se smjha diya..also every line of code is understood thanks

[@Niki_0011]

I don't know why college teachers don't teach these questions in this way. You are great, Bhaiya. Love from Uttarakhand ❤️

[@vikassinghbisht7305]

Pahadi always rocks ❤

[@AkshitChaudhary-vx8iw]

Mst padhaya hai. hard transform to Easy : )

[@BhaveshJaiswal_o7]

really a great teacher ,means leagend god level bhai

[@Devil-ze9kc]

Maja aa gya bhai ... Seriously enjoyed the way you revealed the suspense of LPS wala technique

[@himanshukumar97]

Best explanation ❤ KMP done ✅

[@rajendertanwar1881]

Best explanation ❤ after watching whole video, i assure you (viewers) that you're at right place ✅️

[@davidsharma9662]

Bro you just nailed it!🔥

[@prakashnandan7337]

at 1:00:53 pre ==2, so it must be at index 2 not at 4

[@CoderArmy9]

right, thanks

[@PrashantKumar-gy1qs]

Hats off to you sir your content is best.

[@rocketgamerzz.7577]

Brute force ko hum O(N) mein bhi toh kr sakte hain ? agr ek temp string le lein and saare prefixk nikalne k liye iterate over the string , temp mein push_back a character and push_back temp into a vector of string every time , saare prefix aa gaye ,and similary O(n) mien saare suffix nikal sakte hain and then at the end bas saare saare same index waale sting in in pre array and suff array ko compare krna hai ,which is O(n^2).

[@atifmalik8012]

4:53 //Brute force approach //pass all the test cases but time complexity is O(n²) class Solution { public: int lps(string str) { if(str.size()==1) return 0; int start=0,end=1; while(end

[@yashsawalkar646]

Understood all. For the viewers you have to give it a brief thought and dry run it in mid so that it becomes intuitive

[@musaifbangi8705]

People who read "string matching" from cormen book would know how easy is kmp algorithm 😅

[@mydiary6023]

sir nice explanation aikdum aaram se samajh aaya

[@Pixelofficialmohit]

Next level content ❤

[@Aman_Panchal27]

Easy to understand than other tutorials and blogs also.

[@vidyansh3813]

bhaiya at 30:42 why 3 aise toh piche jo hmne 5 th index pe 0 likha vahan toh 2 likh skte the \

[@musaifbangi8705]

Kmp is use for string matching that is to find a string s1 is part of s2 or not

[@manikgoyal8026]

thank you bhaiya, after struggling too much for kmp, today I got the clarity

[@sarojkumar-wb7tk]

best explanation 🤩

[@AmanKesari-d6e]

Too good bhaiya.

[@vanshikasoni6950]

Space Complexity of brute force is O(2N) ~ O(N)

[@tusharnanda3885]

at 1:01:11 it should be index = 2 ???

[@fachoyt9686]

Yes.

[@joydeep-halder]

9:05 Space complexity will be O(n^2) because every element of prefix or suffix array will have kind of n length.

[@subhojit627]

I think the space complexity will be O(n)

[@Sony_47]

i am also think its o(n), because in space n+n = n.

[@joydeep-halder]

My thought process behind O(n²) is that, for suffix, the string length will be like 1,2,3,4...n-1 and for prefix also it will be array of strings of length 1,2,3,4..n-1 So basically if we join two arrays string as compliment like from array1 we take string of length 1, and from array2 we take string n-1. Then from array1 we take 2, and from array2 n-2 and like so. Thus both array will compliment each other and will create an array of n strings and each string will have n length. So it will become basically O(n²)

[@NajmGameplay]

u r gae@@joydeep-halder

[@Algorithmswithsubham]

2n? hoga kya

[@karankumar3983]

24:39 to 27:05 49:22 to 54:30 conclusion of whole LPS concept

[@sarveshpawaskar5363]

Thank you Rohit sir/bhaiyya.....❤

[@motivationalmajakkhel]

Hello bhaiya, brute force approach to check for longest prefix and suffix int maxi = 0; int first = 0, last = s.size()-1; string one=""; string two=""; while(first0){ one+=s[first]; two=s[last]+two; if(one == two){ maxi = one.size(); } first++; last--; }

[@abhinavparashar1934]

Corrected code of Longest prefix suffix Method : Longest prefix suffix Code start from here #include #include using namespace std; int main() { string s; cout

[@killflag9850]

Starting mee meri bhat ke char hoo gayi yar 😂

[@musaifbangi8705]

1:00:30 the index is 2 not 4

[@MaheshPatil-of1zy]

Imagine If One Can Discover KMP in the interview itself to solve, Just GOD LEVEL🥶🥶🥶

[@janaSdj]

Not possible

[@janaSdj]

Too hard to figure it out....

[@fachoyt9686]

Great Lecture.

[@isroindia9648]

My code for brute force approach at 4:40 text = "ABCDEABCD" #prefix array list1=[] for i in range(len(text)-1): if len(list1)==0: list1.append(text[i]) else: res=list1[i-1]+text[i] list1.append(res) for i in list1: print(i) #suffix array list2=[] j=len(text)-1 while j>0: if len(list2)==0: list2.append(text[j]) else: res=text[j]+list2[-1] list2.append(res) j-=1 for i in list2: print(i) # calculating longest prefix suffix max_length=0 for prefix in list1: if prefix in list2: length=len(prefix) max_length=max(max_length,length) print(max_length)

[@snehaprasad8]

GREAT EXPLANATION🤩

[@Priceful_peace]

Time complexity O(2n-2) for brute force ?

[@akhileshbhagat6721]

hardest hardest kh kr asani se samjha dia wah

[@saitanush9453]

Tq bhaiya, aaj kuch naya seekha😄😄

[@priyanshasharma4443]

you made this topic easy thanks

[@SamirKumarRakshit-c4z]

Brute force in python: word = "ABGHCABGH" prefix = [] ans = "" for i in range(8): ans += word[i] prefix.append(ans) suffix = [] anss = "" for i in range(1, 9): anss = word[-i]+anss suffix.append(anss) for index in range(len(prefix)): if(prefix[index] == suffix[index]): print (prefix[index])

[@rishabhshenoy3258]

9:11 On2 hogi kyunki ham string ka array banayege jo string is a type of array , so 2d array jesa kaam hoga

[@heetpatel3037]

Aapki jitni tarif kare utni kam hai ❤

[@myyoutubeisthis]

Thank you sur for this amazing explanation

[@nitinduke]

bhot ache se samjh aagya bhaiya

[@JitCodeHub.]

KMP Stands For????????????????

[@Vaibhavvashishtha123]

Knuth morris pratt

[@shrivvlogs6045]

Love u bhiya ❤️

[@AlphaJava-q6j]

Sach me bhaiya tussi great ho 🎉🎉❤❤❤ kal ke DAA ke exam me fod ke aunga🎉❤

[@pratik.784]

bhot badhiya samjhaya

[@shivnathsinghgaur5972]

HA G Bhiya Chamka . Thank you

[@piyushsinghdtu456]

thanks sir

[@akashkewat1219]

Done todays lecture thank Bhaiya😊

[@kaushalshinde8]

best explaination..

[@YashSaini007]

Bhaiya Radhe Radhe 🙏

[@khushisingh-hb9kq]

Great explanation

[@joydeep-halder]

Good morning bhaiya ❤❤

[@heetpatel3037]

Chamka bhaiya chamka 👍🏻

[@vipulkumar1830]

chamak gya bhaiya ek dam

[@bharatmehta30]

Thanks bhaiya. chamak gya

[@ankushladani496]

Thanks Bhaiya...❤🎉

[@Sony_47]

bhaiya i think , 52:00 me D me LPS ki value 2 hogi . ky mai galat hu?

[@Ajeetkumar-uo4hf]

Rohit bhai median of two sorted array (Binary Search) wala question pe video bana do . Avi tak 10 video dekh chuka hu youtube par but samjh nhi aa rha hai pls expain🙏

[@rashisahu8511]

Amazing explanation

[@AMITKUMAR-ds4hp]

Good morning boss ❤

[@joydeep-halder]

Bhaiya mai exact algorithm nhi bana paya, lekin mai soch rha tha ki humlog is fact ko use ker sakte hai kya ki mid se start kare dhundna. then vo initial search space thora kam ho jayega. 🤔🤔

[@mdreion]

Best❤️💚

[@ankushladani496]

Done Bhaiya... Day 58/180 ✅

[@omprakashnahak3074]

best KMP algorithm video ❤

[@Aryan-wl7mc]

Is this last video on strings?

[@VikasKumar-th7ml]

no probably 1 or 2 lecture aur honge

[@sakshinadankar3782]

Thank u😊

[@lyricalboy9281]

bhaiya concept bhi chamka aur code bhi #180dayscodingchallenege #coderArmy