Karp-Rabin String Matching Algorithm | Substring Search Pattern 

DSA + interview preparation playlist: ru-vid.com/group/PL9gnSGHSqcnr_DxHsP7AW9ftq0AtAyYqJ

If anyone is new to this bootcamp! Let me tell you it's amazing I've completed almost every single videos so far. By the end of the playlist you'll have so much confidence to tackle DSA questions by your own. Just make sure you're following the notes + assignments & Tips that kunal gives !! Some tips that I always remember when i approach a problem (kunal has mentioned it) - Don't memorize, understand the problem / logic - Hard Question is easy for those who have studied, Easy Question is hard for those who haven't - The function will return from where it was called !! ( Recursion )

Kunal that updateHash method is kind of clever ha!! nice technique!!! Thanks for sharing your knowledge!!!!

These videos are so great, i am also done with each and every video, and just looking forward for notification of new Videos, .... It would be very grateful of Mr. Kunal if he could be more frequent in uploading videos, ❤❤ i don't have much patience for your videos

String has a function called contains( " "). It has Log n complexity :) , Rabin karp can be said as more algorithmic approach whereas contains can be classified as general apporach

I guess the CalculateHash function will get to the limit of mathematical computations. suppose str.length() is around 1000 It would need to calcu;ate 101^1000 and that is out of bounds of long storage, and I guess pow() too couldn't cacluate it.

Love from Jashore University of science and technology ,Bangladesh Sir❤. I am from non cs, following you to be a selftaught programmer.

Best course i suggested many friends ❤❤❤❤

Second video on same day❤

At 2:20 the example ur explaining is sliding window technique with a TC of O(26*N)(for this problem) = O(N) By the way Big Fan bruh❤️

Thanks, sir!!

I don't really understand the updateHash function

Great video

Inspirational ❤❤❤

Wah ek sath

Sigma uploaded 2 videos at 3 am

Would this work using something non-prime?

Bro actually it takes n-pattern length times iterated and in each iteration it takes two iterations of length of pattern for generating hashcodes and also checking for same characters or not, if hash is matched Finally it also take O(nxm ) time ❤ Tell me if im wrong☺️ But krunal playlist is awesome🧡🧡🧡

❤❤❤

what if we need to count that how many times b string contains a

Cant we just use b.contains(a)?

🙏👍

Can anyone pls explain why we divide by prime in order to get new hash

not able to understand line no 13

👉 Resources - Join Replit: join.replit.com/kunal-kushwaha - Lecture code: replit.com/@KunalsReplit/KarpRabin-Hashmaps

Hey kunal can you give a refferal to me

I like to say Rabin-karp is it okay

GOAT for a Reason....👍

Thanks Kunal!!