Sync LeetCode submission Runtime - 38 ms (73.39%), Memory - 18.6 MB (7.64%)

Author: jimit105

0850-insert-into-a-sorted-circular-linked-list/README.md

@@ -0,0 +1,41 @@
+<p>Given a Circular Linked List node, which is sorted in non-descending order, write a function to insert a value <code>insertVal</code> into the list such that it remains a sorted circular list. The given node can be a reference to any single node in the list and may not necessarily be the smallest value in the circular list.</p>
+
+<p>If there are multiple suitable places for insertion, you may choose any place to insert the new value. After the insertion, the circular list should remain sorted.</p>
+
+<p>If the list is empty (i.e., the given node is <code>null</code>), you should create a new single circular list and return the reference to that single node. Otherwise, you should return the originally given node.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+<img alt="" src="https://assets.leetcode.com/uploads/2019/01/19/example_1_before_65p.jpg" style="width: 250px; height: 149px;" /><br />
+&nbsp;
+<pre>
+<strong>Input:</strong> head = [3,4,1], insertVal = 2
+<strong>Output:</strong> [3,4,1,2]
+<strong>Explanation:</strong> In the figure above, there is a sorted circular list of three elements. You are given a reference to the node with value 3, and we need to insert 2 into the list. The new node should be inserted between node 1 and node 3. After the insertion, the list should look like this, and we should still return node 3.
+
+<img alt="" src="https://assets.leetcode.com/uploads/2019/01/19/example_1_after_65p.jpg" style="width: 250px; height: 149px;" />
+
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> head = [], insertVal = 1
+<strong>Output:</strong> [1]
+<strong>Explanation:</strong> The list is empty (given head is&nbsp;<code>null</code>). We create a new single circular list and return the reference to that single node.
+</pre>
+
+<p><strong class="example">Example 3:</strong></p>
+
+<pre>
+<strong>Input:</strong> head = [1], insertVal = 0
+<strong>Output:</strong> [1,0]
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li>The number of nodes in the list is in the range <code>[0, 5 * 10<sup>4</sup>]</code>.</li>
+	<li><code>-10<sup>6</sup> &lt;= Node.val, insertVal &lt;= 10<sup>6</sup></code></li>
+</ul>

0850-insert-into-a-sorted-circular-linked-list/solution.py

@@ -0,0 +1,45 @@
+# Time: O(n)
+# Space: O(1)
+
+"""
+# Definition for a Node.
+class Node:
+    def __init__(self, val=None, next=None):
+        self.val = val
+        self.next = next
+"""
+
+class Solution:
+    def insert(self, head: 'Optional[Node]', insertVal: int) -> 'Node':
+
+        # If the list is empty
+        if not head:
+            new_node = Node(insertVal)
+            new_node.next = new_node
+            return new_node
+        
+        curr = head
+
+        while True:
+            # Find a position between two nodes where insertVal fits
+            if curr.val <= insertVal <= curr.next.val:
+                break
+
+            # When we reach the maximum value node (before minimum)
+            elif curr.val > curr.next.val:
+                if insertVal >= curr.val or insertVal <= curr.next.val:
+                    break
+
+            curr = curr.next
+
+            # We've completed one full cycle
+            if curr == head:
+                break
+
+        # Insert new node
+        new_node = Node(insertVal)
+        new_node.next = curr.next
+        curr.next = new_node
+
+        return head
+