From 49c8ea67716f5272f897ee291a2611a75942eed7 Mon Sep 17 00:00:00 2001 From: Deven <63876261+devenperez@users.noreply.github.com> Date: Wed, 26 Nov 2025 17:18:01 -0500 Subject: [PATCH] Create README - LeetHub --- 0328-odd-even-linked-list/README.md | 30 +++++++++++++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 0328-odd-even-linked-list/README.md diff --git a/0328-odd-even-linked-list/README.md b/0328-odd-even-linked-list/README.md new file mode 100644 index 0000000..6e8419b --- /dev/null +++ b/0328-odd-even-linked-list/README.md @@ -0,0 +1,30 @@ +

328. Odd Even Linked List

Medium

Given the head of a singly linked list, group all the nodes with odd indices together followed by the nodes with even indices, and return the reordered list.

+ +

The first node is considered odd, and the second node is even, and so on.

+ +

Note that the relative order inside both the even and odd groups should remain as it was in the input.

+ +

You must solve the problem in O(1) extra space complexity and O(n) time complexity.

+ +

 

+

Example 1:

+ +
+Input: head = [1,2,3,4,5]
+Output: [1,3,5,2,4]
+
+ +

Example 2:

+ +
+Input: head = [2,1,3,5,6,4,7]
+Output: [2,3,6,7,1,5,4]
+
+ +

 

+

Constraints:

+ +