Depth First

Пікірлер

@yixinzhao7721 11 күн бұрын

The drawing is really helpful. Thanks!

@depthfirst1 10 күн бұрын

Glad you found the visualization helpful!

@xinyiwu2837 13 күн бұрын

best explaination vodeo for this question so far

@depthfirst1 12 күн бұрын

I appreciate you watching! Thank you!

@SangriaSarah 14 күн бұрын

Very clearly explained. Just subscribed to your channel. Thanks for making a great video!

@depthfirst1 13 күн бұрын

Thank you for subscribing! I'm glad you found the video helpful.

@BlahBlah-zr8ie 25 күн бұрын

very good visualization, thank you. I was trying to find a video with the min heap visualization as well as the dictionary.

@depthfirst1 25 күн бұрын

Glad it was helpful!

@BrogrammerHQ Ай бұрын

Great explaination. Thanks

@depthfirst1 Ай бұрын

You are welcome!

@bhagirathmakwana9112 Ай бұрын

This is very good explanation, thank you 👍

@depthfirst1 Ай бұрын

You are welcome!

@benurajesh Ай бұрын

Great 😃

@depthfirst1 Ай бұрын

Thank you!

@FizzyHandlenottaken Ай бұрын

incredible explanation, thankyou so much

@depthfirst1 Ай бұрын

You're very welcome!

@L22Uni 2 ай бұрын

Queen is now making KZbin shorts! 😮

@depthfirst1 2 ай бұрын

@rostislav_engineer 3 ай бұрын

thank you for this video

@depthfirst1 3 ай бұрын

You are very welcome!

@Redman-mp4sn 3 ай бұрын

Great stuff. I knew nothing about trie, now I have a basic understanding of what it is, why it is and how it is implemented. Thanks and keep up ✨

@depthfirst1 3 ай бұрын

Thank you! Glad it was helpful! If you have any critical feedback, please feel free to share. I value it as it will help me improve the content.

@a.m.4154 4 ай бұрын

Only finding out Python's 𝚑𝚎𝚊𝚙𝚚 module actually allows insertion of tuple entries. Had to use my own custom heap ADT implementation before seeing the code.

@a.m.4154 4 ай бұрын

This is a weird algorithm because while it is easy, it is not exactly intuitive.

@depthfirst1 4 ай бұрын

Yeah, Dijkstra's algorithm might seem unintuitive at first, but visualizing each step can help clarify it.

@prem_kumar 4 ай бұрын

Your voice, the animation, the quality of the video, and your way of teaching are outstanding, engaging, and incredibly effective.

@depthfirst1 4 ай бұрын

Thank you so much for your kind words! I'm thrilled to hear that you found the video engaging and effective. Your feedback means a lot to me and motivates me to keep creating quality content. 😃

@walterrutherford8321 4 ай бұрын

I most often think of multi-player games like chess when someone is talking about computer backtracking. You must be careful when writing the search algorithm that the program will eventually stop either by finding a solution, exhausting all possible choices, or by limiting how long the program will run. You must also be careful that the program can’t move forward to a position earlier in the search as this will produce a loop.

@depthfirst1 4 ай бұрын

Yup!

@suhasjain5974 4 ай бұрын

great to see you keeping posting videos even after getting less views. But none the less , I had gone through so many quick select videos , but your video is the one that helped me. So thanks for that, will go through this one as well !

@depthfirst1 4 ай бұрын

I am very glad Quickselect was helpful! I hope you enjoy this video as well!

@dmitrykovpak7344 5 ай бұрын

Thanks for the video. I really liked it!

@depthfirst1 5 ай бұрын

Glad to hear that!

@Redman-mp4sn 5 ай бұрын

Great

@depthfirst1 5 ай бұрын

Thanks a bunch!

@markuscwatson 5 ай бұрын

Another great video. Good job 👏

@depthfirst1 5 ай бұрын

Thank you! Cheers!

@markuscwatson 5 ай бұрын

Keep it up with these great videos man!

@depthfirst1 5 ай бұрын

Thanks so much for the encouragement! Appreciate it!

@markuscwatson 5 ай бұрын

Great video. Thanks for sharing

@depthfirst1 5 ай бұрын

Thanks for watching!

@sallaklamhayyen9876 5 ай бұрын

great explanation = thank you so much 🥰🥰🥰

@depthfirst1 5 ай бұрын

You’re welcome 😊

@mandarbhatye17 5 ай бұрын

Fantastic explanation along with algorithm walkthrough.

@depthfirst1 5 ай бұрын

Thank you!

@jancsi-vera 5 ай бұрын

Let me backtrack, you’re onto something great here, taking another pass

@depthfirst1 5 ай бұрын

Thank you so much! I appreciate it.

@enriqueortiz551 5 ай бұрын

On the function `findKthLargest_1`, the condition should be `if len(heap) >= k:`. Otherwise, for example, run your function with this test: `print(findKthLargest_1([1, 2], 2))`. Without this condition, you get, 1, but clearly the answer is 2. The second biggest element is clearly 2.

@depthfirst1 5 ай бұрын

Hello, Thank you for your comment! The condition 'if len(heap) > k:` is correct because it ensures that the heap contains exactly k largest elements. For nums = [1, 2] and k = 2, the function correctly returns 1, which is the 2nd largest element, as 2 is the largest and 1 is the next largest.