Skip to main content

Compare Two Lists and Find Missing Element in Second List - Python

Compare Two Lists and Find Missing Element in Second List - Python

Solutions

Iterating smaller list and removing the element from other list #516 ns

def finder(a, b):
  for i in b:
    a.remove(i)
  return a

Sorting, Zipping, Comparing each pair and returning first occurrence of mismatching pair #984 ns

def finder2(a,b):
  a.sort()
  b.sort()
  for num1, num2, in zip(a,b):
    if num1!=num2:
      return num1
  return a[-1]

Adding to dictionary and counting occurrence #5250 ns

import collections
def finder3(a,b):
  
  d = collections.defaultdict(int)
  
  for n in b:
    d[n] += 1
  
  for m in a:
    if d[m] == 0:
      return m
    else:
      d[m] -= 1

Subtracting sum of smaller list from larger list #538 ns

def finder4(a,b):
  return sum(a) - sum(b)

Testing Time

a = [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20]
b = [19,10,20,9,11,6,12,3,13,2,14,4,15,8,16,5,17,1,18]
%timeit finder(a, b)
%timeit finder2(a, b)
%timeit finder3(a, b)
%timeit finder4(a, b)

Output

The slowest run took 12.04 times longer than the fastest. This could mean that an intermediate result is being cached. 1000000 loops, best of 3: 516 ns per loop The slowest run took 26.17 times longer than the fastest. This could mean that an intermediate result is being cached. 1000000 loops, best of 3: 984 ns per loop 100000 loops, best of 3: 5.25 µs per loop The slowest run took 5.56 times longer than the fastest. This could mean that an intermediate result is being cached. 1000000 loops, best of 3: 538 ns per loop

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