Видео

Thank you brother

Codebagel is officially my favorite DSA channel. Thank you!

Only problem with dsa is practical approach... theory part understood well and coding of those sortings are somewhat difficult...do we need to bihot the logic?

there are one god . he is allah

i'm reviewing hash maps for interviews, this is the best video i've found! if I had watched this when I was originally learning about hash maps, I think the concept would have come to me more easily :)

Java? OMG, Java is total shit. Fuck you. Bad video.

I'm pretty sure bro follows Statquest !😁

We need more videos

Are these amazon coding questions fr ??

Can i code with JavaScript?

Or instead of appending each value into the result list, you can also do return(list(hashMap.values()))

Ayy Codebagel had my country Pakistan 😄

Can you use the sorted string as the key, since strings are also immutable?

Amazing !! Thanks.

thanks alot

love the video

Not sure why you have only 56.9K subs! Earned a sub!

0:10 BFS & DFS are not searches, they are traversals 0:22 greedy is not algorithm, its an approach

nice video, but becoming a dev in 4 months is absolute crap

Your video is so helpful!!❤❤ty

good, you explained all the fundamentals and everything, sure there are many other things as well but these are so important and any beginner and someone who has atleast less than 3yoe should know these very well, because some stuff like system design can be considered for 3+ yoe . But the main things you listed them out well WOrth a like! cheers

A dictionary would work as a "Dictionary" (Maps in Python) ;)

useful and informative great job and good content. I want to see more like this one.

how does merge sort once it has more than 2 elements in sub arrays ? I feel like it was left out

Where are you , its been 2 years Your videos are soo good we need more

Me i started in python, but learn node.js and react easily 😂 , this guy is a joke

By reading - you meen random access. If you have index/iterator already reading from linked list isn't slower, it just locating the partiular index is slower. So, visiting every element is the same complexity for arrays and linked list (if we omit non contiguous memory access pattern and cache misses)

Thank you for simplifying algorithms for me! I learned a lot from you, keep up this amazing tutoring 🙏🏻

wowwwww....

Watching this Oct '24, and there's no referral vid :') Super bummed, but great video and content nonetheless!

This was great, thank you!

I'd do more than just print or log while debugging. Place more effort on step debugging with breakpoints to widen the context and shorten your time guessing what could be wrong.

Why does this channel have only 55.6K subscribers? Dude you are a gem! Love your videos, they are very helpful!

Java, no way, C/C++ is the GOATed starting point.

Or, you could try C# + Dapper + Stored procs and enjoy life ..... Go is adorable, but it's got nothing on the speed and vast abilities of C#. Yes, I know. Concurrency models and panics. C# has had most of what Go has and much, much more. Way more support for xplat as well, don't have to use templ to do basic HTML from BE, etc. I could go on....

I was today years old to understand hashmaps are also called dictionaries 😅

i think i am not getting the insertion sort because you are saying that we swap the value but we swap the value in the bubble sort and in the insertion sort we catch the value of index [0] and then we compare with that value and assign the position here is the code public static int[] Insertionsort(int[] Element) { //[5,10,8,6,2,1] int n =Element.Length; for (int i = 1; i < n; i++) { int temp = Element[i]; //10 int j = i - 1; //0 while ((j >= 0) && Element[j] > temp ) // 10 >8 { Element[j + 1] = Element[j]; j--; } Element[j + 1] = temp; } return Element; }

Great video!

My first time watching your video and I had to subscribe right away! Amazing video, thank you.

Thanks!

i love itttttttttt

Thank you.

🔥

greatttttt

Great video and great comments!

I'll come back one year later to this comment and be grateful I did not give up. Thanks for this video. Today is day 1

Pls upload more videos

Please explain then, why not use the best O(logn) always as its the best right?.

Amazing, simple and so visual!!!! Subscribed , thank you thank you thank you ! -Monika

Lovely explanation !!! Please update the channel with more content on Data Structures