From 0ccd9794f06bacea7cae5d6a6cac39f62d8976af Mon Sep 17 00:00:00 2001
From: Prad Nukala <prad@sonr.io>
Date: Wed, 14 Oct 2026 10:48:34 -0400
Subject: [PATCH] docs(docs): delete Reorder List documentation

---
 .../linked-list/143_reorder-list.mdx          | 42 -------------------
 1 file changed, 42 deletions(-)
 delete mode 100644 apps/docs/content/(02-nodal-grid)/linked-list/143_reorder-list.mdx

diff --git a/apps/docs/content/(02-nodal-grid)/linked-list/143_reorder-list.mdx b/apps/docs/content/(02-nodal-grid)/linked-list/143_reorder-list.mdx
deleted file mode 100644
index a8b9dd2..0000000
--- a/apps/docs/content/(02-nodal-grid)/linked-list/143_reorder-list.mdx
+++ /dev/null
@@ -1,42 +0,0 @@
----
-title: '143. Reorder List'
-description: 'You are given the head of a singly linked-list. The list can be represented as:'
-icon: dot
-topics:
-  - { name: "Linked List", slug: "linked-list" }
-  - { name: "Two Pointers", slug: "two-pointers" }
-  - { name: "Stack", slug: "stack" }
-  - { name: "Recursion", slug: "recursion" }
-issue: "https://github.com/prdlk/leetcode/issues/81"
-sidebar:
-  label: 'Reorder List'
-  badge: 'Medium'
----
-
-### 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`
-
-## Solution
-
-```py
-# 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.
-        """
-```