From b922205bd060f3cda40ad780ab66533c8defaafe Mon Sep 17 00:00:00 2001
From: Prad Nukala <prad@sonr.io>
Date: Wed, 14 Oct 2026 10:47:47 -0400
Subject: [PATCH] feat(work): add Reorder List solution

---
 work/1/Medium/Linked List/143.reorder-list.py | 52 +++++++++++++++++++
 1 file changed, 52 insertions(+)
 create mode 100644 work/1/Medium/Linked List/143.reorder-list.py

diff --git a/work/1/Medium/Linked List/143.reorder-list.py b/work/1/Medium/Linked List/143.reorder-list.py
new file mode 100644
index 0000000..2da591f
--- /dev/null
+++ b/work/1/Medium/Linked List/143.reorder-list.py	
@@ -0,0 +1,52 @@
+"""
+143. Reorder List
+Difficulty: Medium
+https://leetcode.com/problems/reorder-list/
+
+──────────────────────────────────────────────────
+
+You are given the head of a singly linked-list. The list can be
+represented as:
+
+L0 &rarr; L1 &rarr; &hellip; &rarr; Ln - 1 &rarr; Ln
+
+Reorder the list to be on the following form:
+
+L0 &rarr; Ln &rarr; L1 &rarr; Ln - 1 &rarr; L2 &rarr; Ln - 2 &rarr;
+&hellip;
+
+You may not modify the values in the list's nodes. Only nodes
+themselves may be changed.
+
+ 
+
+Example 1:
+
+Input: head = [1,2,3,4]
+Output: [1,4,2,3]
+
+Example 2:
+
+Input: head = [1,2,3,4,5]
+Output: [1,5,2,4,3]
+
+ 
+
+Constraints:
+
+	• The number of nodes in the list is in the range [1, 5 * 10^4].
+
+	• 1 <= Node.val <= 1000
+"""
+
+# Definition for singly-linked list.
+# class ListNode:
+#     def __init__(self, val=0, next=None):
+#         self.val = val
+#         self.next = next
+class Solution:
+    def reorderList(self, head: ListNode | None) -> None:
+        """
+        Do not return anything, modify head in-place instead.
+        """
+