Problem:
Rearrange the linked list L0 → L1 → … → Ln into L0 → Ln → L1 → Ln-1 → …
This must be done in-place with O(1) space.
✅ In this video, we cover:
Finding the middle with two pointers
Reversing the second half
Merging both halves in zig-zag fashion
📌 Problem:
https://leetcode.com/problems/reorder-list/
📌 Timestamps:
00:00 – Introduction
00:35 – Problem Explanation
02:00 – BruteForce solution
03:30 – optimal solution
15:40 – Complete Code Walkthrough & Edge Cases
#Blind75 #Leetcode #Python #BinaryTree #Recursion #DSA #CodingInterview
