Sync LeetCode submission Runtime - 42 ms (27.68%), Memory - 16.8 MB (91.02%)

Author: jimit105

0725-split-linked-list-in-parts/README.md

@@ -0,0 +1,36 @@
+<p>Given the <code>head</code> of a singly linked list and an integer <code>k</code>, split the linked list into <code>k</code> consecutive linked list parts.</p>
+
+<p>The length of each part should be as equal as possible: no two parts should have a size differing by more than one. This may lead to some parts being null.</p>
+
+<p>The parts should be in the order of occurrence in the input list, and parts occurring earlier should always have a size greater than or equal to parts occurring later.</p>
+
+<p>Return <em>an array of the </em><code>k</code><em> parts</em>.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+<img alt="" src="https://assets.leetcode.com/uploads/2021/06/13/split1-lc.jpg" style="width: 400px; height: 134px;" />
+<pre>
+<strong>Input:</strong> head = [1,2,3], k = 5
+<strong>Output:</strong> [[1],[2],[3],[],[]]
+<strong>Explanation:</strong>
+The first element output[0] has output[0].val = 1, output[0].next = null.
+The last element output[4] is null, but its string representation as a ListNode is [].
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+<img alt="" src="https://assets.leetcode.com/uploads/2021/06/13/split2-lc.jpg" style="width: 600px; height: 60px;" />
+<pre>
+<strong>Input:</strong> head = [1,2,3,4,5,6,7,8,9,10], k = 3
+<strong>Output:</strong> [[1,2,3,4],[5,6,7],[8,9,10]]
+<strong>Explanation:</strong>
+The input has been split into consecutive parts with size difference at most 1, and earlier parts are a larger size than the later parts.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li>The number of nodes in the list is in the range <code>[0, 1000]</code>.</li>
+	<li><code>0 &lt;= Node.val &lt;= 1000</code></li>
+	<li><code>1 &lt;= k &lt;= 50</code></li>
+</ul>

0725-split-linked-list-in-parts/solution.py

@@ -0,0 +1,32 @@
+# Approach 2: Split Input List
+
+# Time: O(N + k)
+# Space: O(k)
+
+# Definition for singly-linked list.
+# class ListNode:
+#     def __init__(self, val=0, next=None):
+#         self.val = val
+#         self.next = next
+class Solution:
+    def splitListToParts(self, head: Optional[ListNode], k: int) -> List[Optional[ListNode]]:
+        curr = head
+        for N in range(1001):
+            if not curr:
+                break
+            curr = curr.next
+
+        width, remainder = divmod(N, k)
+
+        ans = []
+        curr = head
+
+        for i in range(k):
+            temp = curr
+            for j in range(width + (i < remainder) - 1):
+                if curr:
+                    curr = curr.next
+            if curr:
+                curr.next, curr = None, curr.next
+            ans.append(temp)
+        return ans