3045. Count Prefix and Suffix Pairs I & II | Trie | Hashing | Complete Intuition

preview_player
Показать описание
In this video, I'll talk about how to solve Leetcode 3045. Count Prefix and Suffix Pairs II | Trie | Hashing

Let's Connect:

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 - Bakwas
1:39 - Problem Explanation
2:55 - Brute Force (Part - I)
8:46 - Intuition of Hashing (Rabin karp)
13:40 - Realising Hashing is not Sufficient
15:37 - Linking with Trie (Vids link in Description)
17:02 - Understanding how Trie can be used
21:01 - Finding Hack to compare both Prefix & Suffix at same time
27:32 - Dry Run of Trie
35:02 - Code & Complexity Explanation

✨ Hashtags ✨
#programming #Interviews #leetcode #faang #maang #datastructures #algorithms
Рекомендации по теме
Комментарии
Автор

Apologies for a day late, but Corporate life is like this only🫠🧑🏻‍🦯

ARYANMITTAL
Автор

Great trie + hashing explanation 41:38

ordinarylunatic
Автор

congratulations, just on the basis of a video you got a new subscriber

urdaddy
Автор

Op bhaiya waiting from yesterday for this video

ashish
Автор

Got something new to learn. Thank you bro. ❤❤

sukritiguin
Автор

holy shiz this guys explanation and build up to the solution was amazing

cc-tojn