@smartinussen
What a roller coaster, easy -> turn tricky fast -> explain trickyness = we're all good. Thanks for this
@Topcatyo.
These videos are exceptionally well-presented and explained. Really love these
@EhteshamShahzad
2:36 I see we are measuring the depth of our dict 🌚
@onimisiadeolu8378
okay, i really like your teaching style, i've been stuck in tutorial hell for a really long time,i mean i know alot of things but they are soo scattered, i really like backend development, and i havent really found a channel that teaches that it's mostly frontend stuff, do you have a backend course playlist?
@valentinrafael9201
Every while loop ( depending how your language does while loops, looking at you Go ) is conceptually a recursion. The issue with recursive functions is that it's not so obvious where things go. When you go form the example in this video with n and n-1 and then you are thrown into merge sort, it feels like a pretty big leap. The obvious difference ( in programming ) is that a while loop wont keep on using more and more memory, like recursion, even though they are literally doing the same thing.
@tomzimny7408
I miss the old thumbnail. It would be funny if you did a video on refactoring and reuploaded it after 6 months.
@imohanthony
Great explanation
@JohnJacob-pl3xg
I'm so confused. How are bows in the melee weapons and not ranged? Maybe I'm still reading it wrong.
@CallousCoder
Recursion in 10 seconds: Calling the current function itself. Be mindful of stack overflows. Done….
@philofessor
this makes sense in a recursive call but when you call the function in your program do you have to provide a max_depth_so_far ? that seems wrong
@bootdotdev