วีดีโอ

Hey. Could you please explain how to calculate the time complexity?

Giving the mathematical explanation for getting the entry point of cycle was the best part !

Crazy explanation 🔥😎

Amazing video

4 -> 6 -> 2 -> 7 -> 1 -> 3 -> 8 -> 5 -> 9 --- ^ | |___________________________| i hope the alignment is right but if not then basically 9 just points to 2 here. why is this not the graph at 9:15?

How did you make videos like this? This is very informative and is great for visualising algorithms while also explaining the coding for it.

Very good stuff, thanks for the compiling this video.

Thank you so much, been looking for ways to make my multiplication more efficient

Hello from Russia I am a first-year student at the university and we were asked to implement this method. I searched the entire Internet, but I could not understand this algorithm and how to implement it until I came across you. Such a clear and good explanation. Thank you very much!!

The math formula is straightforward but still, i'm like HOW DOES THEY JUST MEET when we do that starting point reset!

I found myself spending days on this - it feels so disappointing! Is this normal?? I got to try solve it(did not finish) in a longer approach too, probably inefficient - i feel defeated! I did not use backtracking. I seem to get confused with recursion every time despite having lots of experience! Is this normal? Is it possible to come up with this solution from the get go in 5 minutes if one has never done it before? Thank you for sharing this video - it's been very well explained - + 1 like and subscribe.

Thanks a lot 😊

Does this work for bodies in 3D space?

My dear you tuber , First solve sudoku in paper and tell about algorithm for program THE ALGORITHM WILL NOT WORK #error

Nice content, dropping a like right now

here is a node solution for the exercise at the end of the video: import { strictEqual } from "assert"; const vowels = new Map([ ["a", "a"], ["e", "e"], ["i", "i"], ["o", "o"], ["u", "u"], ]); const isVowel = (v: string) => vowels.has(v); const countVowels = (string: string, span = 5) => { let vowelsCount = 0; let maxVowels = 0; for (let i = 0; i < string.length; i++) { if (i - span - 1 > -1) { if (isVowel(string[i - span - 1])) { vowelsCount--; } } if (isVowel(string[i])) { vowelsCount++; } if (vowelsCount > maxVowels) { maxVowels = vowelsCount; } } return maxVowels; }; const input = "bacacbefaobeacfe"; strictEqual( countVowels(input), 4, "The expected ammount of vowels was 4, got " + countVowels(input) );

5:18 video was in full screen and i was thinking my laptop crashed...

perfect, sooo good. the best one i found. keep posting videos bro. ur are doing great !!!!!!

Thank you so much, this is a brilliant explanation

you are genius <3

awesome video!

Nice man 👍 Thank u bro ♥️

Exactly what I was looking for Thanks !

Amazing way of presenting… it’s awesome

excellent presentation thank you

thanks

Thanks

Thanks

thanks

Thanks

Thanks

By far the best video about Heap-sort algorithm. Thank you!

PayPal link for paying back for this amazing explanation?

Thanks

Well explained! Thanks!

Thanks

Thanks

Thanks

thanks

Thanks

Thanks

Thanks

Thanks

Thanks

Woah that was some good visualization!

Just the best idea to approach binary 🌲 questions

I finally got it! I kept making the 1+1+1=01 instead of 11

Awesome explanation!!

I may be wrong, but if we only care about the root of the element's set, why don't we just find the root of element x when uniting, and set it to the root of element y? That would make the find() method's time complexity O(1).

Nice work, thank you!