Reorder List | Leet code 143 | Theory explained + Python code

[@SteveWoznokav]

I liked your approach. Most people use dynamic programming for the solution but you applied both, stack+ queue for the solution. On the leetcode website, this question is under stacks therefore your solution is okay but if the interviewer is an as..... he may tell you ,you used stacks and queues at the same time since you pop from the left(popleft() used for queue) so the answer will not be valid if the interviewer asks you to use only stacks so also try ONLY popping the last element in the array/List. What i am saying is that it is very important to have multiple solutions for a problem, try to solve it using only stacks. But i loved your solution....

[@saleheen1]

That was super helpful and easy to understand

[@carpedim24]

Great explanation, I have a series request for you , Can you please make videos on data structures implemented in python???

[@rohitmujumdar8195]

Haven't they asked us to do this in place? Can we employ another data structure here (eg. queue)?

[@ppippiminiverse4040]

Your explanation is crystal clear. Superb!!!

[@saianishmalla2646]

Thanks a lot glad it helps

[@krishnaharshith9854]

Excellent explanation man. Really loved it!!

[@pythonenthusiast9292]

great explanation, I have a series request for you , Can you please make videos on data structures implemented in python? it would be awesome man!

[@saianishmalla2646]

Thank you! And actually I have been planning on doing thing right now I wanted tk start off by doing sorting algorithms from there I'll do data structure and so on.

[@pythonenthusiast9292]

@@saianishmalla2646 great !

[@praneetkomandur6576]

great vid

[@gastonjarju1370]

Great explanation!

[@saianishmalla2646]

Thank you! glad it helped!

[@dddddddddr]

Thank you!

[@vm7240]

how did you know that there will be a cycle ?

[@codedoctor3265]

Space - O(1) Time: O(N) class Solution: def reorderList(self, head: ListNode) -> None: """ Do not return anything, modify head in-place instead. """ fast = slow = head while fast and fast.next: fast = fast.next.next slow = slow.next prev = None cur = slow while cur: next_node = cur.next cur.next = prev prev = cur cur = next_node first = head second = prev while second and second.next: t1 = first.next first.next = second t2 = second.next second.next = t1 first = t1 second = t2

[@tapaskumarswain9862]

could u plz explain ur code.. it will be greater man

[@anitaiitgn6729]

can you this problem without import anything.