Пікірлер

• 
  @mfc87tech5210 сағат бұрын

  Hello my friend, allah bless you, I could not find the course cause the link is broken

• 
  @RA-eg8tw13 сағат бұрын

  This was amazing! I actually understood the sudoku backtracking algorithm finally.

• 
  @Rishi-he7hsКүн бұрын

  You can alsow think in terms of relative velocity From the point of view of slow pointer, fast pointer is moving 1 node ahead at a time So if finally fast pointer reaches the slow one, then definitely there is a cycle I think, using the similar approach if you move slow pointer n times forward and the fast one (n+1) times forward, that should also work

• 
  @Bachelor0524 күн бұрын

  Thanks!

• 
  @pavanbalu27349 күн бұрын

  I think, In the end code slow and fast should point to arr[0] instead of just 0

• 
  @madhavkwatra58889 күн бұрын

  Superb explanation , Thanks.

• 
  @DheerajKumar-fn4zq10 күн бұрын

  I wasted a lot of time understanding it, thanks to this amazing video I finally understood :).

• 
  @playingwithmhdsulu78612 күн бұрын

  Help full video thank you❤

• 
  @user-kp2uk3cg4g13 күн бұрын

  Best video

• 
  @gimmametdeboys150514 күн бұрын

  Really liked the tree visualtion, made it so much easier to understand.

• 
  @TABandiTA14 күн бұрын

  Thanks a lot. We need more non-indian math/coding youtubers.

• 
  @ishajindal786215 күн бұрын

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

• 
  @vocipy206815 күн бұрын

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

• 
  @R_SinghRajput15 күн бұрын

  Crazy explanation 🔥😎

• 
  @spiritgaming649916 күн бұрын

  Amazing video

• 
  @nanon100418 күн бұрын

  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?

• 
  @anhduc091319 күн бұрын

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

• 
  @chandrashekharmuradnar568122 күн бұрын

  Very good stuff, thanks for the compiling this video.

• 
  @polishane883724 күн бұрын

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

• 
  @w1thluv24 күн бұрын

  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!!

• 
  @grindinglcmeow26 күн бұрын

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

• 
  @duncancamilleri861426 күн бұрын

  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.

• 
  @mojiside27 күн бұрын

  Thanks a lot 😊

• 
  @aakashs180627 күн бұрын

  Does this work for bodies in 3D space?

• 
  @2casandeepsaran38828 күн бұрын

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

• 
  @rodrigoelias198729 күн бұрын

  Nice content, dropping a like right now

• 
  @rodrigoelias198729 күн бұрын

  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) );

• 
  @fluorite29 күн бұрын

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

• 
  @ort.schoolАй бұрын

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

• 
  @tommyp713Ай бұрын

  Thank you so much, this is a brilliant explanation

• 
  @hammadhassan9014Ай бұрын

  you are genius <3

• 
  @arsh2544Ай бұрын

  awesome video!

• 
  @callmeitshАй бұрын

  Nice man 👍 Thank u bro ♥️

• 
  @antoine2571Ай бұрын

  Exactly what I was looking for Thanks !

• 
  @auntyBillАй бұрын

  Amazing way of presenting… it’s awesome

• 
  @rsKayiiraАй бұрын

  excellent presentation thank you

• 
  @subee128Ай бұрын

  thanks

• 
  @subee128Ай бұрын

  Thanks

• 
  @subee128Ай бұрын

  Thanks

• 
  @subee128Ай бұрын

  thanks

• 
  @subee128Ай бұрын

  Thanks

• 
  @subee128Ай бұрын

  Thanks

• 
  @shyngysbek6907Ай бұрын

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

• 
  @ahadali3908Ай бұрын

  PayPal link for paying back for this amazing explanation?

• 
  @subee128Ай бұрын

  Thanks

• 
  @andy2011goАй бұрын

  Well explained! Thanks!

• 
  @subee128Ай бұрын

  Thanks

• 
  @subee128Ай бұрын

  Thanks

• 
  @subee128Ай бұрын

  Thanks

• 
  @subee128Ай бұрын

  thanks