legend

love this guy!

Thanks for the video, Bro. very clear explanation. camera is little blur. formula is not visible. it's my sincere request, use better camera Bro. Thank you very much.

kaha gaya usse dhundho... u should come back... views would sky rocket and it'll really help a lof of people .... your vides are clear precise and exactly too the point...

saved my ass :)

Thank you!!! The explanation at 3:24 was so good! It really helps if you watch this video with the pseudocode for the prefix/lps table and the peusodocde for kmp search in front of you 😄 happy coding!

You are my life teacher

This is the best explanation of the knapsack problem! Thank you very much.

3 mins in , very clear, great explanation

Crystal clear sir

Hello geeks, I have a question, how will this be executed T[0][I] = T[0][i-2] for i=1, it will throw an exception "index out of bound". Can someone please help me with this?

Who all come from chat gpt recommendation

GOAT of dynamic problem solution.

even given eternal time to me, I cannot come up with this algorithm... I know It is really typical problem. wow so difficult;;

Beautiful explanation

Wow the intro is so good!! now I understand why thread(link) is needed! bc we have to come back root, without stack or recursion! wow Thanks my teacher!!!

0:01 turn on subtitles and see Tushar's name 😂😂

Very good 😮

the only man on the internet to nail this explanation

Phenomenal tutorial, very clear. Thanks!

Anyone in 2024 July??

Should have commented on the uniqueness of rolling hash bruhhhh

thank you sir

Excelent video, helped a lot

bro thx a lot.. most of the youtuber now a days just focus on learning the dp and do recursive solution then convert into dp (tabulation) just follow the prewritten steps by some youtuber.. they don't understand, how amazing the tabulation is..

why youtube didn't recommended when i searched KMP wasted 1 hour 😭

Very poor explanation 🙄🙄

I have seen many other videos for this problem, but yours is the one that made me follow every step clearly. Thank you!

Arigato

In the video, you said the TC of building the BIT is O(nlogn). If we use a prefix sum array just for making the tree, we can reduce it to O(n) right?

Not understand

great video

Thanks for a clear explanetion :D

Nicely explained

best explaination on internet

Thankyou so much sir

9:41 if suppose there is a tiny url exising for a long url and you do put, then it will override the existing tiny url.. will it make sense?

Thank you! This is the most thorough video explanation on Morris Traversal that I have been able to find.

there is a problem at 6:45 , after visiting -1 , we got to 2 , then we begin finding predecessor of 2 , Alas , finding predecessor of 2 means going right most in left sub-tree of 2 , here left subtree is -1 , then lets find predecessor ,-1 -> right = 2 , then 2-> right = 5 , 5-> right = 6 , 6-> right = 8 , 8 ->right = 10 , we are moving in totally different direction ....now . Actually this must stop when predecessor is found , but for predecessor , we keep moving right ? Edit: Now I saw the final code , while finding predecessor , you solved the problem by doing , predecessor-> right = current , then break .

Q1. How communication is done b/w servers? Ex. N2 and N3 Q2. How search will be performed on the data present in blob/cold storage?

The best explaination with perfect testcases that I found for this question on Internet. Thank you!

Why do you not make any more videos? These videos are literally gems! I wish you had made more videos on the system design!

Thank you. Very detail and understandable.

Best explanation,I have watched so far!

Thank you great explanation

why 8? i cant undrestand:(

Why do you sfeak and not speak 😂😂

Hero

Won't the counter/all-host/range_based approch generate duplicate tiny urls? With these approaches how do I search if a long url already exists? Won't a DB table [long -> tiny] also be required to avoid duplicate URL generation?

Thank you ,master