Rabin Karp Algorithm - Single Hash & Double Hash (Worst Case O(n)) - String Matching Algorithm

In this video, I'll talk about how "Rabin Karp Algorithm" - Single Hash & Double Hash (Worst Case O(n)) - String Matching Algorithm

KMP:    • Find Beautiful Indices in the Given A...  
Practice Problem1 -    • 3031. Minimum Time to Revert Word to ...  
Practice Problem2 -    • 3036. Number of Subarrays That Match ...  

Let's Connect:
📝Linkedin:   / aryan-mittal-0077  
📸 Instagram:   / ez.pz.dsa  
📱Telegram : https://t.me/aryan_mittal_group
🤖 Github: https://github.com/aryan-0077

About Me:
I am Aryan Mittal - A Software Engineer in Goldman Sachs, Speaker, Creator & Educator. During my free time, I create programming education content on this channel & also how to use that to grow :)

✨ Timelines✨
0:00 - What to expect
1:16 - Problem Explanation
2:07 - Brute Force
5:40 - Intuition (with simple hash)
8:10 - Draw backs of existing hash
10:10 - Making new rigid hash function
17:12 - How Rabin karp will work with new Hash (Dry Run)
24:26 - Code Explanation
34:40 - Double Hashing
40:28 - Double Hashing Code Explanation

✨ Hashtags ✨
#programming #Interviews #leetcode #faang #maang #datastructures #algorithms