From e3d915513dcec2a5ce9a2c5fd4820f12f3651633 Mon Sep 17 00:00:00 2001
From: Prad Nukala <prad@sonr.io>
Date: Wed, 14 Oct 2026 15:52:06 -0400
Subject: [PATCH] feat(work): add Partition List solution stub

---
 .../1/Medium/Linked List/86.partition-list.py | 44 +++++++++++++++++++
 1 file changed, 44 insertions(+)
 create mode 100644 work/1/Medium/Linked List/86.partition-list.py

diff --git a/work/1/Medium/Linked List/86.partition-list.py b/work/1/Medium/Linked List/86.partition-list.py
new file mode 100644
index 0000000..6ce82d5
--- /dev/null
+++ b/work/1/Medium/Linked List/86.partition-list.py	
@@ -0,0 +1,44 @@
+"""
+86. Partition List
+Difficulty: Medium
+https://leetcode.com/problems/partition-list/
+
+──────────────────────────────────────────────────
+
+Given the head of a linked list and a value x, partition it such that
+all nodes less than x come before nodes greater than or equal to x.
+
+You should preserve the original relative order of the nodes in each
+of the two partitions.
+
+ 
+
+Example 1:
+
+Input: head = [1,4,3,2,5,2], x = 3
+Output: [1,2,2,4,3,5]
+
+Example 2:
+
+Input: head = [2,1], x = 2
+Output: [1,2]
+
+ 
+
+Constraints:
+
+	• The number of nodes in the list is in the range [0, 200].
+
+	• -100 <= Node.val <= 100
+
+	• -200 <= x <= 200
+"""
+
+# Definition for singly-linked list.
+# class ListNode:
+#     def __init__(self, val=0, next=None):
+#         self.val = val
+#         self.next = next
+class Solution:
+    def partition(self, head: ListNode | None, x: int) -> ListNode | None:
+