Reorder List (LeetCode 143) | Full Solution with 3 step process and animations

[@matthewzarate8851]

Wow, I had an identical problem to this that was on my data structures exam last Fall semester!

[@matthewzarate8851]

Thanks for the helpful explanation too! After watching the idea behind the approach I was able to complete it on my own. Thx Nikhil!!

[@nikoo28]

always happy to hear that

[@minhajurrahmanmahi9757]

you are the best. keep going

[@eduardoignacioroblessosa6349]

this problem should be marked as difficult >.

[@subramanya_l]

THANK YOU

[@ashok2089]

Nice explanation!

[@huynhduc9]

For a list with 4 nodes, and when we are finding the midpoint, doesn't p1 stop at the node before the midpoint?
4 -> 8 ->15 -> 16
It stops at 8..

[@kanaramjangid8563]

Sir i have been learning dsa from last 4 months and practice on my vs code . Can i now upload my solutions to leedcode account sooner or later

[@nikoo28]

You can upload them anytime. Didn’t understand your question

[@kanaramjangid8563]

​@@nikoo28I have practised dsa problems only in vs code editor. Now I am submitting my solutions to leetcode profile

[@yomamasofat413]

well the easiest way to solve a linked list problem I think is to not use one in the first place