9.2 Rabin-Karp String Matching Algorithm

preview_player
Показать описание
Rabin-Karp String Matching Algorithm

It is useful for matching multiple patterns simultaneously.

Courses on Udemy
================
Java Programming

Data Structures using C and C++

C++ Programming
Рекомендации по теме
Комментарии
Автор

I completed my most of the syllabus from Abdul sir's lectures..just night before exam..no other videos are better than this..

pushpakwakode
Автор

Abdul Bari is one of the best teachers of algorithms. You see his video once and you get it no matter how hard the topic is. I wish my teachers in college were like him. If Mr Bari is reading this: Sir Thank you! Can you also make videos on topics like system design?

shantanubapat
Автор

Great content sir ... i have watched video of Geeks4rGeeks, TusharRoy ... but ur content was the one which actually cleared my confusion ... thank you sir

nandkishorenangre
Автор

This video clears my confusion by starting simple. I love how you go from naive hash function to show the importance of picking a good hash function to avoid collisions. Great video and subbed.

xdewtr
Автор

Great explanation sir, you summed up the entire video in just 23 mins and after watching your video, I can understand each and every line of Cormen very easily. ThankYou Sir.

hrishabhsingh
Автор

I was confused about this algo for whole day and you just cleared it in just 20 minutes. Thanks a lot Abdul. Subscribed !!!

Fatality_Retired
Автор

Gem of an instructor, if only the algorithms could be explained in a class that way, nobody would be intimated by DSA.

AsifKhan-ynwp
Автор

Abdul Bari, this is just a tremendous help. I started deeply understanding after you split the algorithm into several steps discussing the drawbacks. Excellent content. LIKE & SUB

cristiangomez
Автор

Thank you so much! Our professor gave such a random explanation that it simply wasn't understandable, this here on the other hand was perfect!

AnaximanderA
Автор

I love this algorithm! with average TC being O(m-n+1) as taught by sir, when the two strings are equal, i.e. m = n, the algorithm becomes O(1). In fact the concept that the pattern length reduces the complexity just blows my mind!! They do say it correct, the bigger, the better. Thank you sir

vishaldas
Автор

only you explained well why the algorithms is engineered that way, thank you!

xiaoweidu
Автор

As clear as a bright sunny day! Thank you Sir!

norielgalang
Автор

best explanation ever...👌👌
The one thing which makes you look different from other teachers is that you keep gaps between words perfectly along with perfect body language and hand movement . When I saw 24 minutes videos of other teachers, I feel like yawning😁😁😁😁.
But not in your case.

VishalKumar-pkek
Автор

Wonderfully clear explanation. Thank you so much! Keep up the good work.

Mumma
Автор

Man really good explanation even for dummies, simple and clear.Nice video. Thanks

joseantoniomartinezquinto
Автор

I was having trouble and anxiety when I saw this in class.. I thought, what is this? Because the teacher didn't give any examples like these. Thank you sir, for explaining these algorithms with simple explanations and visualizing it. It really helped me to understand!

min_ara
Автор

Fabulous explanation ....you are a Legend of Algorithm Free resource is very very Valuable for The students who know nothing about an Algorithm

gopalmer
Автор

You can't get better explanation of Rabin Karp Algorithm than this one.
Just wow💕💕❤️

ieetscode
Автор

Thank you for your wonderful explanation. It is so helpful to understand the code and what it's doing!

kirubelmelak
Автор

Amazing video mate. I can't imagine how you managed to fit the main concepts in CRLS's Algorithms textbook for this algorithm in only 23 minutes. Respect for that.

therealajmelmuadz