Minimum Depth of Binary Tree (LeetCode 111) | Full solution w/ graphical examples | Study Algorithms

preview_player
Показать описание


📖 Reference Books:

🎥 My Recording Gear:

💻 Get Social 💻

#leetcode #programming #interview
Рекомендации по теме
Комментарии
Автор

i have not find any better teacher than u ur explanation was amazing in every vedio thanku

aman_rockstar
Автор

The way you explain every solution is too good, much appreciated.

amitbhattacharya
Автор

How camly u explained bit by bit was super cool, coded it myself listening to the explanation

pritishpattnaik
Автор

thank you for always explaining well and making sure we understand. even though I'm a javascript developer I always try to find your videos bcus you're a great teacher

kolawoleabdulrahman
Автор

u r great sir.. but this is very bad that u still dont have much subscriber.. u teach very calmly with a smile on ur face that makes the problem more easier..

vahngodisgracious
Автор

thank you sir for the wonderful explanation!!

tanishkaagarwal
Автор

Please explain dynamic programming questions from blind 75 like coin change and decode ways

dddm
Автор

Brother your explanation is nice and i learn alot from your video

-ASHUKUMARSINGH-IT-A
Автор

Very good explanation . It helped me a lot . Keep it up . 🤗

pallabnath
Автор

The brute force method you mentioned here, not sure if that can be implemented without using recursion or using queue. And if recursion or queue is being used, then how does it remain a brute force. It would be nice if you can provide some reference to brute force somewhere.

mohitramana
Автор

Bro do U teach in bits pilani data structures subject??

likhithakande
Автор

Thank you for your video it was really helpful !!!

My question is can we solve the problem without using another loop the loop for ? since i want to do a code that doesnt surpass O(n²) in complexity

ISABELLEDUPONTTT
Автор

I heard same voice same as U who is teaching data structures in bits pilani online

likhithakande
Автор

improve voice quality and increase volume

tanmay