Skip to main content

Merge two sorted linked lists in order - Python Interview Question

Given two sorted linked lists, merge them in order.


def merge(self, list1, list2):
  # Fill this in.

# Definition for a Linked List.
class ListNode(object):
  def __init__(self, x):
    self.val = x
    self.next = None

This can be done recursively and iteratively. See if you can get both solutions.

See the solution

This problem can be solved recursively or iteratively. We traverse the two linked lists in parallel, advancing both pointers simultaneously. If the first list's value is smaller we advance that one, otherwise we advance the second list. If either list is shorter, then we take values from the longer list. The time complexity is linear O(n) since both lists are traversed just once. The space complexity of the recursive algorithm is linear O(n), since it builds up a recursive stack that may be as deep as the length of both lists. The space complexity of the iterative solution is constant O(1), since only a few variables are used.
# Definition for singly-linked list.
class ListNode(object):
  def __init__(self, x):
    self.val = x
    self.next = None

class Solution:
  def mergeTwoLists(self, l1, l2):
    if l1 is None:
      return l2
    elif l2 is None:
      return l1
    elif l1.val < l2.val:
      l1.next = self.mergeTwoLists(l1.next, l2)
      return l1
    else:
      l2.next = self.mergeTwoLists(l1, l2.next)
      return l2

  def mergeTwoListsIterative(self, l1, l2):
    current = None
    root = None
    while True:
      if l1 is None:
        nextNode = l2
      elif l2 is None:
        nextNode = l1
      elif l1.val < l2.val:
        nextNode = l1
      else:
        nextNode = l2

      if nextNode == l1:
        l1 = l1.next if l1 else None
      if nextNode == l2:
        l2 = l2.next if l2 else None

      if nextNode is None:
        break
      if not current:
        current = nextNode
        root = current
      else:
        current.next = nextNode
      current = nextNode
    return root

# Test program
a = ListNode(1)
a.next = ListNode(3)
a.next.next = ListNode(5)

b = ListNode(2)
b.next = ListNode(4)
b.next.next = ListNode(6)

c = Solution().mergeTwoListsIterative(a, b)
while c:
  print c.val 
  c = c.next

Comments

Post a Comment

Popular posts from this blog

Python - List - Append, Count, Extend, Index, Insert, Pop, Remove, Reverse, Sort

🐍 Advance List List is widely used and it's functionalities are heavily useful. Append Adds one element at the end of the list. Syntax list1.append(value) Input l1 = [1, 2, 3] l1.append(4) l1 Output [1, 2, 3, 4] append can be used to add any datatype in a list. It can even add list inside list. Caution: Append does not return anything. It just appends the list. Count .count(value) counts the number of occurrences of an element in the list. Syntax list1.count(value) Input l1 = [1, 2, 3, 4, 3] l1.count(3) Output 2 It returns 0 if the value is not found in the list. Extend .count(value) counts the number of occurrences of an element in the list. Syntax list1.extend(list) Input l1 = [1, 2, 3] l1.extend([4, 5]) Output [1, 2, 3, 4, 5] If we use append, entire list will be added to the first list like one element. Extend, i nstead of considering a list as one element, it joins the two lists one after other. Append works in the following way. Input l1 = [1, 2, 3] l1.append([4, 5]) Output...
Post a Comment
Read more

Difference between .exec() and .execPopulate() in Mongoose?

Here I answer what is the difference between .exec() and .execPopulate() in Mongoose? .exec() is used with a query while .execPopulate() is used with a document Syntax for .exec() is as follows: Model.query() . populate ( 'field' ) . exec () // returns promise . then ( function ( document ) { console . log ( document ); }); Syntax for .execPopulate() is as follows: fetchedDocument . populate ( 'field' ) . execPopulate () // returns promise . then ( function ( document ) { console . log ( document ); }); When working with individual document use .execPopulate(), for model query use .exec(). Both returns a promise. One can do without .exec() or .execPopulate() but then has to pass a callback in populate.
1 comment
Read more

683 K Empty Slots

  Approach #1: Insert Into Sorted Structure [Accepted] Intuition Let's add flowers in the order they bloom. When each flower blooms, we check it's neighbors to see if they can satisfy the condition with the current flower. Algorithm We'll maintain  active , a sorted data structure containing every flower that has currently bloomed. When we add a flower to  active , we should check it's lower and higher neighbors. If some neighbor satisfies the condition, we know the condition occurred first on this day. Complexity Analysis Time Complexity (Java):  O(N \log N) O ( N lo g N ) , where  N N  is the length of  flowers . Every insertion and search is  O(\log N) O ( lo g N ) . Time Complexity (Python):  O(N^2) O ( N 2 ) . As above, except  list.insert  is  O(N) O ( N ) . Space Complexity:  O(N) O ( N ) , the size of  active . Approach #2: Min Queue [Accepted] Intuition For each contiguous block ("window") of  k  po...
Post a Comment
Read more