Leetcode Accepted.

PriyankaKhire · PriyankaKhire · commit 8710f886bcf4 · 2021-08-21T22:00:23.000-07:00
diff --git a/Blind 75/Programs/Merge Two Sorted Lists.py b/Blind 75/Programs/Merge Two Sorted Lists.py
@@ -0,0 +1,36 @@
+# Merge Two Sorted Lists
+# https://leetcode.com/problems/merge-two-sorted-lists/
+
+# Definition for singly-linked list.
+# class ListNode(object):
+#     def __init__(self, val=0, next=None):
+#         self.val = val
+#         self.next = next
+class Solution(object):
+    def mergeTwoLists(self, l1, l2):
+        # create an empty head for the list
+        head = ListNode()
+        # assign pointer to this head, this is to keep track.
+        ptr = head
+        # while both the lists are still alive.
+        while(l1 and l2):
+            if (l1.val < l2.val):
+                ptr.next = l1
+                l1 = l1.next
+            else:
+                ptr.next = l2
+                l2 = l2.next
+            ptr = ptr.next
+        # add remaining of the lists
+        if (l1):
+            ptr.next = l1
+        if (l2):
+            ptr.next = l2
+        # return the head next since head is empty pointer.
+        return head.next
+        """
+        :type l1: ListNode
+        :type l2: ListNode
+        :rtype: ListNode
+        """
+        
diff --git a/Blind 75/README.md b/Blind 75/README.md
@@ -172,7 +172,10 @@
           You can also solve this porblem by having a hash table and making note of all the nodes seen so far. 
         </p>
       </li>
-      <li>Merge Two Sorted Lists</li>
+      <li><a href="Programs/Merge Two Sorted Lists.py">Merge Two Sorted Lists</a>
+        <p><b>Approach</b>: Simple O(n) merging, by traversing both lists at the same time.
+        </p>
+      </li>
       <li>Merge K Sorted Lists</li>
       <li>Remove Nth Node From End Of List</li>
       <li>Reorder List</li>
