Відео

Awesome tutorial. Not where I thought that was going

لا بأس بالمحتوى التقني ايضا👍

Aahhhhhhh.... So he wrote at the bottom found at 5 10 How did he figure this out? Shoudnt it be 5 13? Aahhhh....why coudnt ge complete the full thing?..he forgot the main thing..where does the pattern start and end..how to find that Anyone tell me this

may i know what is blockchain?

this visualization is so well done

Amazing video, thanks!

Very good sir

absolutly loved it! i always wanted visually explained solutions of LeeCode Questions.

These are amazing! Thank you for creating so much quality content. Manim question: how do you label the edges in your weighted graphs? I've only found workarounds using unofficial plugins that don't look very good and may become outdated someday

spectacular thank you!!!

After union with C, A's rank should be 2, isn't it!! And after union with D it's rank should be further increased from 2!!

Excellent explanation! Although, I must say using `l` instead of `j` for the prefix-suffix array part was quite confusing at first. Like when `lps[i]` gets updated to `l` when `pattern[i] == pattern[l]`, I thought it was being updated to the value 1 and was confused lol But the visuals helped me understand the KMP algorithm on a deeper level, and that's all that matters, so thank you!

The problem with all these KMP videos is , they are all jumping from naive approach directly to a pattern of suffix==prefix matching ( abc...abc ). What if the pattern is "abcde" ? Which I think is the most crucial part of the algo.

this is called education🔥🔥. If educational activities feel boring, it's a scam

You have a great voice. I hope the decision was to save your throat and not imposter syndrome. Would you like to sell it?

There is one mistake I found: if pat[j]==text[i]: i+=1 j+=1 if j==m: print(i-j) j=lps_[j-1]

So is a DNF Spoofing similar to a man in the middle attack ?

I hope this video gets more views

superbbb... 🌟

Hi, Can any one tell which software we can use to make this kind of video

❤❤❤can't thank u enough brother 🙏

Thanks a lort bro it more helpfull

Great content! Great animations!

Can you please explain how you came to the bruteforce time complexity of O((n - m + 1) * m / 2) specifically the m / 2 part. I understand the n - m + 1 part since we are not looping the full string. I am not able to understand the m / 2 part. Unless we are doing some optimisation to reduce the pattern searching by half which is not possible/ we are not doing in bruteforce. You have mentioned: On average, it compares m / 2 characters which I don't think is the case or even if it is the case, we don't give time complexity considering average cases or best cases. We give it according to worst cases. So at the end, the time complexity would come to O((n - m + 1) * m) which we can say as O(n * m).

Bro u should have so much more Subs. Keep on buddy!!!!!!!!

The individual videos are also available on the channel, you can checkout. This video is just an ordered merged video.

DSA playlist should have all these subsections as individual videos in the right order. Just a suggestion.

This is god-sent. Thank you very much for your hard work.

Great video great work brother🫡🫡🔥🔥🔥 subbed 🙌

underrated

Thank you sooooooo much!!! Self explanatory now😊

useful content thanks btw brother!

GREAT

thank you

Sweet, can you make an intro to python series ?

Thanks 👍🏼

Underrated channel. High quality video. Starting was a little abrupt but the explanation in the video is so detailed. Absolutely love it.

Nice video 👍

thanks

AWESOME!!

Awesome!!

what is the shortest path from A to D ?

I have a doubt. For example, A is the sender, B is the receiver, and C is a hacker. A encrypts the text (e.g., "I am Ashwin") using B's public key. Is there a chance that C (the hacker) could modify the text (e.g., to "I am Vinoth") using the same public key of B? If so, when B decrypts the message using B's private key, they would get the text "I am Vinoth" instead of "I am Ashwin." In this case, C (the hacker) cannot see the original message sent by A but has modified the message that was sent by A.