Пікірлер

• 
  @bokumentation3 күн бұрын

  This is what i need as comp engineering student. Many tutorial there are just not enough to fill my curoisity. But this make me more understood about c and memory management. Thanks

• 
  @Purple_Alien424 күн бұрын

  A student of computer science here. This is one of the best recursion videos I've seen on yt. You give the simplest and very very clean explanations. I love your channel, it's one of the best I came across. You helped me understand so many things very clearly. Thank you <3! And please keep making videos :)))

• 
  @bisheshwarraj32255 күн бұрын

  thanks man it really helped me.

• 
  @MAKSTECH2755 күн бұрын

  even if I am Learning it in C , it is more clearer than others anything resources ,

• 
  @MAKSTECH2755 күн бұрын

  thank you

• 
  @nguyenkhanh77595 күн бұрын

  thank you, you will be missed

• 
  @siddhantprakash.6 күн бұрын

  It's always good to come back to basics once in a while. Really loved the explanations.

• 
  @whothefucktookmyalias6 күн бұрын

  Minor correction: main as is, must return a value of type int

• 
  @ramavathvivek70917 күн бұрын

  I dont how the lecture was passed away but may your soul rest in peace sir 🙏

• 
  @nancy63437 күн бұрын

  Awesome video

• 
  @Dhivakar8 күн бұрын

  Thank you for clearly explaining O(1) and O(n) with example. Easy to understand. Your videos ❤❤❤❤ Love learning. God bless you!

• 
  @Bcawalaaspirant8 күн бұрын

  Iam now getting 🙏😮‍💨

• 
  @nuradilzholmukhan867210 күн бұрын

  holy shit what a golden video! THANKS

• 
  @Greenndjdhdjjd10 күн бұрын

  This is it for this lesson .Thanks for watching❤❤❤❤.love you❤❤

• 
  @stephenmurichu455911 күн бұрын

  This is the most effective explanation I've found on KZread

• 
  @jackm60311 күн бұрын

  I hava nerver met a class like this one. It is really easy to understnd and kind for beginner.

• 
  @Greenndjdhdjjd11 күн бұрын

  You are better than a professor Thanks for your great teaching❤❤

• 
  @suhairtahir12 күн бұрын

  thank you

• 
  @stephenmurichu455914 күн бұрын

  The best educational channel.

• 
  @stephenmurichu455914 күн бұрын

  Amazing clarity and detail in the explanation.

• 
  @praveenbadiger861914 күн бұрын

  All-time top, I am re-visiting after 6 years still no one can simplify to this level. hats off to the trainer

• 
  @umairsaeed592514 күн бұрын

  11 years old video still worth it

• 
  @RajeswariReddy-fl4yq15 күн бұрын

  Who is still seeing these videos in 2024

• 
  @ashutoshverma141815 күн бұрын

  def insertion(arr): left=0 right=1 element=arr[right] while right>len(arr): while left>=0 and arr[left]>arr[right]: arr[left+1]=arr[left] left-=1 arr[left+1]=arr[right] right+=1 left=right-1 return arr

• 
  @llarn.i510315 күн бұрын

  It’s been 10 YEARS since this playlist and people are still watching it, I don’t usually comment but Really Thank you for this masterpiece

• 
  @19.sairoopesh1016 күн бұрын

  The quality of these videos is amazing. The aspect ratio is perfect, the voice is clear, and I love how they use different colors for functions, recursion, and loops. It's crazy to think that this quality is from almost 10 years ago

• 
  @19.sairoopesh1016 күн бұрын

  rest in peace🙏

• 
  @channelname946817 күн бұрын

  Great video, random indian guy always comes in clutch 😤😤😤😤

• 
  @rahathossainhimel717717 күн бұрын

  It's been 11 years and this is still the best explanation I found on KZread, no fancy stuff just pure teaching. (2)

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

  Bro is cook so perfect

• 
  @Rajyalakshmi95817 күн бұрын

  He explained 10years ago still no one can beat him

• 
  @abijithmjolly354719 күн бұрын

• 
  @Hanes-Workspace20 күн бұрын

  Awesome man 👍

• 
  @SachinVerma-dw3mz21 күн бұрын

  11 years later , revising this topic from the videos feels nostalgic

• 
  @SlayMx_Sg21 күн бұрын

  I guess in simple path the second example is incorrect.....A,B,F,H,E,B,A,D has vertices and edges repeated .......it must come under trail....correct me if i am wrong

• 
  @aakrit442122 күн бұрын

  In Dequeue If(front==rear) front=null rear=null Whats the purpose of that?

• 
  @Chaimaa.allali.0324 күн бұрын

  after 10 years thank you sssssssooooooooo much

• 
  @GuidoPerdomo25 күн бұрын

  I came here from Hackerrank. Sadly, this solution, which uses the addresses of the nodes doesn't work for languages that don't use them (i.e. Javascript or Python). What I did, which has the same time complexity (although maybe uses more storage), is to reverse each list, compare each value and save the latest that was common. When the lists no longer have the same value, then it means that they have diverged, and so I return the latest value in common.

• 
  @SundusKrs26 күн бұрын

  Thank you.

• 
  @pcpardon26 күн бұрын

  Even though, You are long gone, your work and legacy still inspires me. Even today, when I wanted have quick refresh on my basics, I would still visit here. May you attain nibbana.

• 
  @yousefa.963327 күн бұрын

  Excellent explanation.

• 
  @shishirgupta597827 күн бұрын

  Thanks to you; now I'm more confused 😕

• 
  @sharvendranair857128 күн бұрын

  insanely great explanation

• 
  @Alphasaquad28 күн бұрын

• 
  @balaganesh344028 күн бұрын

  I just came back to hear your voice again. People don’t understand that unlike today, the computer science in the 2010s hit a different feel.

• 
  @liyuesmondlin100329 күн бұрын

  Rip

• 
  @KienNguyen-zc5lkАй бұрын

  thank you very much

• 
  @fareesahmalik2308Ай бұрын

  11 years later, thank you!

• 
  @devjeff3192Ай бұрын

  Pretty good explaination!

• 
  @venkireddy6587Ай бұрын

  Thank you Sir