Reverse Linked List II - Leetcode 92 - Python

0:00 - Read the problem
4:08 - Drawing Explanation
7:47 - Coding Phase-1
11:00 - Coding Phase-2
14:50 - Coding Phase-3

leetcode 92

#coding #interview #python
Disclosure: Some of the links above may be affiliate links, from which I may earn a small commission.

[shelllu]

For those who find this problem chanllenging, you are not alone. This is still by far the best explanation for this problem. Highly encourage you to hang in there, pause the video multiple times, understand it, take a break and come back to it. It will eventually make sense, as long as you don't give up and show up to understand it.

[mashab]

coding it piece by piece after each illustrated/explained block was a great idea. thank you!

[AmrElmohtaseb]

It brings me an immense relief whenever I'm facing an issue understanding a LeetCode problem and I find you have a video for it.

[prestonbourne]

I like this style of explaining where you go back and forth between the drawing and the code. It helps me mentally map the concept directly to implementation

[iugaialeksei]

Dude, I have nothing but admiration for how you approach various problems. Every time you do it clear, simple and smooth.

[MP-nyep]

Breaking it into 3 parts helped a lot. Thank you

[pingpangqiu]

Very good illustration and idea. I feel I will never be able to solve this within a normal coding interview session by myself

[jadkhalil]

Great video only thing that got me was the edge cases. Very clever to use the dummy node, You could say it was some NeetCode.

[quirkyquester]

great explanation! this problem seems easy, but it's really tricky

[triscuit]

ollie mollie man, this is such a great explanation, you've got such a talent to convey information. Congrats on the job, well deserved. I myself got interviews lined up pretty much with all of FAANG and your videos are my go-to source when I want to just sit and watch something rather than practice hands-on coding.

[shinewbiez]

Coding while explaining was a great idea and more understandable, kindly follow the same pattern for further videos!

[carloscarrillo]

You really deserve heaven, good man! Thanks so much for doing this. A donation is totally well deserved!

[abhishekkulkarni]

I am simply amazed by the clear explanation! Just simply wow...Thank you so much

[dennisgray]

Another way to think about the very first part of this algorithm is: "Until current.val is L, move the prev/curr pointers up". I found this to be a more intuitive way of thinking than the (left - 1) approach here (YMMV).

Similarly, in the second phase of the algorithm, instead of thinking about indicies you can just think about it like this: "Reverse the list, once prev.val = R you, you know you're done reversing the sublist."

I find the less I can think about indicies the more high-level I can think about the algorithm.

[maamounhajnajeeb]

you motivate me to solve problem everyday man

[algosavage]

you are awesome, dude. Thanks for such clear explanations!

[AshwaniSharma-ofnq]

Amazing explanation again, that trick of adding dummy node really helped.

[dabaaku]

Your explanations on these problems helped me a lot! Thanks for all the hard work that went into making these videos.

[sheikhmkrifat]

Thanks for such clear explanations! Love from Bangladesh

[konradhunter]

Great code, as usual! Commenting the code like this is also helpful.