Відео

bro. your way of teaching is such very easy to understand. thanks

Man really appreciate the effort u put in these videos.. u earned a sub

2024 here and the video is the fckng greatest explanation

Wow. This video is incredibly helpful, especially with your very clear animations that are easy to read and not harsh on the eyes. You have managed to explain so much in such a short time.

you saved my life bro, what an amazing video , it's soo professionally made and too clear , thanks man

Thank you very very much !!

I'm back again. xD

wahsh

Isn't top variable obsolete? The top will be always size-1

Great animation

thank you for solving my doubts on queue!!!!

for the do-while loop, when you say tempArr[i++], wouldn't that skip tempArr[0]? Shouldn't it be tempArr[i] = nums[j] then i++ at the end?

5 Star out of 5

is this java or c++? , language you use these lessons

I finally understand how Recursion works

that was very helpful! thank you

Cool 😎

Thank you!

Thanks bro I would’ve failed my data structure course if it wasn’t for your videos

Is it just me or this channel videos does not come out when i search it, like im looking at his video about doubly linked list and i scroll so far down, still cant see it. Its so annoying cus this video is so much better than those thats being recommended.

Very helpful, the diagram and animations really helped the logic flow!

love ur videos !

Hi! I've been following this tutorial and it caught my attention that, when you try to resize the array with your resize() method, you enter the loop with = 0, and do i++ immediately after entering, meaning the first item would effectively be put on index 1. This would be weird, but a valid choice, if not because you then set the front to 0, and the rear to length - 1, even though that'd leave the front one item behind the actual start of the array, and the rear one item behind behind the actual final, as for example, in an array of length 7, the final item would've been placed on the index 7, but the tail would've been placed on the index 6, leaving that last item unaccounted for. Is this a detail of the language you're implementing this in that I'm unaware of? Because I followed your algorithm on paper and I got this final result: cdn.discordapp.com/attachments/714875280505831467/1158598850341240922/circular_buffer_resize.png Edit: another question. say that I wanted to resize an array that's not full. How would you go around implementing that?

Thank you so much! Every part is incredibly well explained.

This is amazing, thank you so much!

very helpful thnx

hey man, great video. just a quick note, the timestamps are slightly off

You are among the best tutors I recommend for any person who wants to understand data structure and algorithm 😊

In the first 10 minutes, you explained something clearer and more concise than a professor trying to teach a masters level data science course.

Cool! much appreciated!

Thanks man!

where are the insert delete to binaryTree video ?

this video is just perfect thanks man!

this is easy unlike circular queue in array

what is the difference between linear q and circular q ??????

You are the best. You left no stone unturned. Thank you👍👍

please continue

please just 1 qustion: AddToEnd(20); AddToEnd(10); AddToEnd(12); 12-> 20-> 10-> 12-> 20-> 10-> 12-> 20-> 10-> 12-> etc.. should the list start with 20 why there's 12 at the first

That’s the best explanation video I’ve seen so far, thank you so much!

you are the legend of the explanation

each code work in php in this video thanx u

Why dont you have a tail and only head? The main advantage of Doubly Linked List is that you dont have to traverse all the way to the end if you want to delete at the end or add at the end because you have tail. But you helped me a lot thank you

This was great, thank you so much!

Thank you 💛

Thank you so much for your time and effort! You not only illutrstate heaps clearly, the animations your made are also neat and beautiful! Really helps me a lot for understand this data structure!

Merda pensava que eram aneis para meter na pissa.

Thank you so much bro these codes are the most readable codes ı have ever seen !

thank you!

man this is probably the best series on youtube for data structures. A lot quicker than those 5 hour videos from other channels while still containing more information while being easily understandable

The method of explaining the difference between pre, in, and post-order made so much sense to me, thank you for this.