You have to create a method "compoundArray" which should take as input two int arrays of different length and return one int array with numbers of both arrays shuffled one by one. 
```Example: 
Input - {1,2,3,4,5,6} and {9,8,7,6} 
Output - {1,9,2,8,3,7,4,6,5,6}
```

Difficulty: introductory

Starter code:

def compound_array(a, b):
	

Solutions:
def compound_array(a, b):
    x = []
    while a or b:
      if a: x.append(a.pop(0))
      if b: x.append(b.pop(0))
    return x

def compound_array(a, b):
    x = min(map(len,(a,b)))
    return sum(map(list,zip(a,b)),[]) + a[x:] + b[x:]

def compound_array(a, b):

  res = []
  
  for i in range(max(len(a), len(b))):
    res.extend(a[i:i+1])
    res.extend(b[i:i+1])
  
  return res

def compound_array(a, b):
    r=[]
    while a or b:
        r+=a[:1]+b[:1]
        a,b=a[1:],b[1:]
    return r

def compound_array(a, b):
    return [l[i] for i in range(max(len(a), len(b))) for l in (a, b) if i < len(l)]


def compound_array(a, b):
    answer = []
    while a or b:
        if a: answer.append(a.pop(0))
        if b: answer.append(b.pop(0))
    return answer

def compound_array(a, b):
    lst = zip(a[:len(b)], b[:len(a)])
    return [item for sublist in lst for item in sublist] + a[len(b):] + b[len(a):]

from itertools import zip_longest
def compound_array(a, b):
    mx = []
    for a,b in zip_longest(a,b):
        mx.append(a)
        mx.append(b)
    return list(filter(lambda x:x!=None, mx))

def compound_array(a, b):
    r=[]
    for i in [[i,j] for i,j in zip(a,b)]:
        r.append(i[0])
        r.append(i[1])
    return r+a[min(len(a),len(b)):]+b[min(len(a),len(b)):]


def compound_array(a, b):
    if a == [] or b == []:
        return a + b
    n = []
    for x in range(len(min([a, b], key=len))):
        n.append(a[x])
        n.append(b[x])
        if x == len(min([a, b], key=len))-1:
            n+=max([a, b], key=len)[x+1:]
    return n