Beautiful. When I do it i always worry about the original parameter being erase so I always create a new separate return valuable. Now I can see that is not neccessary and I could've just reuse the parameter for the result. Tks.
Thank you so much, 3 years ago, and it still valuable today!!!, I have been stuck trying to visualize this for hours due to the use of .next, your video just give me clarification, thank you thank you and thank you
Wow, thank you. I found your video as my professor said he would quiz us on sorting multiple and this video was super clear. The implementations on what stacks we're being called was helpful as well. Thank you so much. I know this wouldn't work for 3 but for 2 this was extremely easy to understand.
despite your explanation being clear-cut and easy to understand, it's still somehow a little bit confusing for beginners like me to really grasp the ins and outs of how this code actually works under the hood.
It is so clear explanation thx but i have a one thing that i didnt understand clearly.I just can't understand the returning part after we recall the function how does it work exactly ?
I wish you went over your thought process for solving this problem. Like what came to mind when you saw this problem and how you thought of your approach.
Fisher Coder, thank you so much for being such a great explainer and taking the time to do these videos! May you please do an Amazon leetcode series? Have a great day!
I loved the explanation. The thing is I can understand from he code, but I cannot understand and then code. How to think in a way to write code not read the code? Any tips especially for recursion?
@@Tren9528 it returns pointer l1 or l2 after function calls are released from stack. Watch the second half of the video when he steps through the code. Recursive functions sits in the stack and on top of each other. When the recursive function finally reached to the base case, it starts to make return value and pass the value to the function sitting below it while the current function is popped off the stack after the work is done. The return value will be either l1 or l2 which are the pointers that point to the finish product. The pointer will be reassigned each time before functions are popped off the stack.
![[#2024MAMA] BIGBANG (빅뱅) - 뱅뱅뱅 (BANG BANG BANG) + FANTASTIC BABY | Mnet 241123 방송](http://i.ytimg.com/vi/EQsYfiPR9uM/mqdefault.jpg)
Beautiful. When I do it i always worry about the original parameter being erase so I always create a new separate return valuable. Now I can see that is not neccessary and I could've just reuse the parameter for the result. Tks.
Right, it's confusing at first glance, and I'm glad that you found this video useful to help understand this probelm! :)
The walk-through using the stacks and the 2 linked lists as they're being built while the code goes on really helps! Subscribed!
After watching more than 5 videos I finally understoon the backtracking from this one. really thankful🥰
Glad it helped!
@@FisherCoder ❤️
Thank you so much, 3 years ago, and it still valuable today!!!, I have been stuck trying to visualize this for hours due to the use of .next, your video just give me clarification, thank you thank you and thank you
Glad it was helpful! Cheers!
A very good idea to use different colours to present l1 and l2 in different calls, very helpful!
Glad it was helpful!
Oh it's so greate. I'm confused with Recursion and I foud this video. Thank youu
Wow, thank you. I found your video as my professor said he would quiz us on sorting multiple and this video was super clear. The implementations on what stacks we're being called was helpful as well. Thank you so much. I know this wouldn't work for 3 but for 2 this was extremely easy to understand.
Glad it helped!
Clear explanation! Thanks!
despite your explanation being clear-cut and easy to understand, it's still somehow a little bit confusing for beginners like me to really grasp the ins and outs of how this code actually works under the hood.
Practice makes perfect, try running code locally a few times and you'll get the gist of it.
Thank you so much for dry running the code. It helps to visualise what I am seeing> You are amazing!
Glad it helped!
It is so clear explanation thx but i have a one thing that i didnt understand clearly.I just can't understand the returning part after we recall the function how does it work exactly ?
You are absolutely awesome man. Thank you!
Glad it was helpful! Thank you!
sir U are amazing teacher . love from INDIA
So explanatory! Many thanks for your visualizations.
Glad it was helpful!
Thank you so much! I was having trouble understanding the final stack calls and this made it so much better
Glad it helped! :)
bruhh, sameeee
Best Explanation ever❤️❤️❤️❤️. Thank you ❤️❤️
Glad it was helpful!
This is the kind of explanation that "gives lemonade seltzer to a heavy stomach" as Koreans have it. Thanks!
Nice and clear .Thank you so much Fisher Coder
Glad it helped
Literally great way of explanation.
Glad it was helpful!
Guy, great explanation with code and graph!!! thank you, keep going.
Glad you liked it!
Excellent and Easy explanation, Thank you so much
Glad it was helpful!
I wish you went over your thought process for solving this problem. Like what came to mind when you saw this problem and how you thought of your approach.
Fisher Coder, thank you so much for being such a great explainer and taking the time to do these videos! May you please do an Amazon leetcode series? Have a great day!
Thank you so much for your clear explanation!
Glad it was helpful!
U r God for new people thanks
Glad it's helpful!
Great explanation. Thank you
Glad it's helpful, thanks!
Awesome explanation 💯🔥
Glad you liked it!
Great explanation. Thanks!!
Glad it helped!
this was excellent explanation
Glad you found it helpful! :)
i'm very bad at visualizing and this was perfect
Glad it helped!
@@FisherCoder no thank you. DS&A in an essence isn't that hard, sometimes you just need a drawn out step by step to get it. And that's what you got.
Great explanation of the answer. Perhaps it would be good to explain to your viewers how one derives this solution rationally?
Thank you so so much! I was looking for such an explaination. You just cleared my all doubts :)
Glad it was helpful!
God bless you, my estimated man
This helped a ton. Thank you so much mate!
No problem 👍
great concept
Great Explanation. Thanks a lot!
Glad it was helpful!
thank you
dude you're a genius
Great explanation man
Glad you liked it!
You're awesome bro..
I loved the explanation. The thing is I can understand from he code, but I cannot understand and then code. How to think in a way to write code not read the code? Any tips especially for recursion?
It was perfect. thank you
You're welcome 😊
Thank you so much!!!
You're welcome!
Very very nice video
Thank you so much 😀
Thanks for helping
You are welcome!
thank you so much!
Glad it helped!
LEGIT HUGE THANKSSS!
ESPECIALLY THE PART ABOUT HOW RECURSIVE CALLS ARE WORKING
Glad it's helpful!
liked it a lot
amazing stuff :)
Glad you think so!
thanks man
Thank you !!!
You're welcome!
this
was
beautiful
Thank you! Glad you found it helpful!
@@FisherCoder cleared up so many lagging ideas . Thanks again
Good Job!
Thank you! Cheers!
great explination.keep it up bro.
Thanks a ton
very nice explaining, but I think the memory space is O(1) because you don't call stack or use push & pop method here
Internally, a stack is used to maintain recursive function calls.
What does return l1 or return l2 do in the recursive if else statement? Return the current pointer?
@@Tren9528 it returns pointer l1 or l2 after function calls are released from stack. Watch the second half of the video when he steps through the code. Recursive functions sits in the stack and on top of each other. When the recursive function finally reached to the base case, it starts to make return value and pass the value to the function sitting below it while the current function is popped off the stack after the work is done. The return value will be either l1 or l2 which are the pointers that point to the finish product. The pointer will be reassigned each time before functions are popped off the stack.
thnx a lot
Welcome!!
You are a good looking guy, you look like me but older
0 sec ..