Видео

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.

very good video, just a slight mistake that I wanna point, there is no need for the final incrementing of i , you already increment i and j if s[i] == p[j], but you increment i again in the else branch at the end, but great work this was very beneficial

Where's the register?

wellexplained

Nicely explained 👏🏼👏🏼, Can you provide the manim code for same?

Just found you videos while studiying CS Networks course and they're being very useful! Thank you for putting out this content in such a well explained way!!

Great work ..Kudo to the efforts it would be more helpful if the video was short ,,,,Keep conitnuing the work and keep helping the community

Best explanation 😊

Nice explanation

Nice video.. Easy to understand the concept.

Great explanation. Easily understandable.

ok now how tf do i make one...

Thank you, finally understood it.

underrated

This is the clearest explanation of KMP! I finally understood it!

That's why they say that C.P.U is the brain of the computer, yeeaahhh!!!

Great demonstration, you need a lot of subscribers! Wish you the best!

Greate efforts man 🔥

Very good excellent explanation

Bogo sort deserves respect for who he is.

Great job! No music, no disturbance, just professional explanation!

Great work...need more from you on 'Cybersecurity '

Man9

Lifesaver ❤

thanks