Complete the function which takes two arguments and returns all numbers which are divisible by the given divisor. First argument is an array of `numbers` and the second is the `divisor`.

## Example

```python
divisible_by([1, 2, 3, 4, 5, 6], 2) == [2, 4, 6]
```

Difficulty: introductory

Starter code:

def divisible_by(numbers, divisor):
	

Solutions:
def divisible_by(numbers, divisor):
    return [x for x in numbers if x%divisor == 0]

def divisible_by(numbers, divisor):
    return [i for i in numbers if i%divisor == 0]

def divisible_by(numbers, divisor):
    return [n for n in numbers if n%divisor==0]

def divisible_by(numbers, divisor):
    div_by = []
    for num in numbers:
        if num % divisor == 0:
            div_by.append(num)
    return div_by

def divisible_by(n, d):
    return list(filter(lambda x: not x%d, n))

def divisible_by(numbers, divisor):
    return [num for num in numbers if not num % divisor]

def divisible_by(numbers, divisor):
    return list(filter(lambda x: x%divisor == 0, numbers))

def divisible_by(numbers, divisor):
    rez = []
    for x in numbers:
        if x % divisor == 0:
            rez.append(x)
    return rez


divisible_by = lambda numbers, divisor: [i for i in numbers if i%divisor==0]

divisible_by = lambda n, d: [e for e in n if not e % d]

divisible_by = lambda l, n: [m for m in l if m % n == 0]

def divisible_by(numbers, divisor):
    result = []
    for num in numbers:
        if num % divisor == 0:
            result.append(num)
    return result

def divisible_by(numbers, divisor):
    return [number for number in numbers if number % divisor == 0]


def divisible_by(numbers, divisor):
    scores = []
    for number in numbers:
        if number % divisor == 0:
            scores.append(number)
    return scores

def divisible_by(numbers, divisor):
    tmp = []
    for i in numbers:
        if i%divisor ==0:
            tmp.append(i)
    return tmp

def divisible_by(numbers, divisor):
    c = []
    for num in numbers:    
        if num % divisor == 0:
            c.append(num)
            
            
              
    return c  
            
        


def divisible_by(numbers, divisor):
    new=[]
    for i in numbers:
        if i%divisor==0:
            new.append(i)
    return new

def divisible_by(numbers, divisor):
    var=[]
    for i in numbers:
        if i % divisor == 0:
            var.append(i)
    return var


def divisible_by(numbers, divisor):
    map = []
    for i in numbers:
        if i % divisor == 0:
            map.append(i)
    return map

def divisible_by(numbers, divisor):
    divNums = []
    for i in numbers:
        if i % divisor == 0:
            divNums.append(i)
    return divNums


def divisible_by(numbers, divisor):
    return [nb for nb in numbers if not nb % divisor]

divisible_by=lambda l,d:[n for n in l if n%d==0]


def divisible_by(numbers, divisor):
    return [i for i in numbers if not i % divisor]

from typing import List

def divisible_by(numbers: List[int], divisor: int) -> List[int]:
    """ Get all numbers which are divisible by the given divisor. """
    return list(filter(lambda it: not it % divisor, numbers))

def divisible_by(n, d):
    x = []
    [x.append(i) for i in n if i % d == 0]
    return x

def divisible_by(numbers, divisors):

    return [ i for i in numbers if i % divisors == 0]

def divisible_by(lst,n):
    return [number for number in lst if number % n == 0]

def divisible_by(l, d):
    return [ n for n in l if not n%d ]

def divisible_by(numbers, divisor):
    return list(x for x in numbers if not(x%divisor))

divisible_by = lambda numbers, divisor : list(filter(lambda a : a % divisor == 0 , numbers))

def divisible_by(numbers, divisor):
    a=list(x for x in numbers if x % divisor ==0)
    return a

divisible_by = lambda numbers, divisor: [i for i in numbers if not i % divisor]

def divisible_by(numbers, divisor):
    num = []
    for i in numbers:
        x = i / divisor
        y = x - int(x)
        if y == 0:
            num.append(i)
    return num


def divisible_by(numbers, divisorr):
    a = []
    for i in numbers:
        if i % divisorr == 0:
            a.append(i)
    return a
        


def divisible_by(numbers, divisor):
    new_list = []
    for elem in numbers:
        if elem % divisor == 0:
            new_list.append(elem)
    return new_list

def divisible_by(numbers, divisor):
    factors = []
    for n in numbers:
        if n % divisor == 0:
            factors.append(n)
    return factors
            


def divisible_by(numbers, divisor):
    final_list = []
    for num in numbers:
        if num % divisor == 0:
            final_list.append(num)
        else:
            continue
    return final_list

def divisible_by(num, div):
    res = []
    i = 0
    while i < len(num):
        if num[i] % div == 0:
            res.append(num[i])
        i += 1
            
    return res

def divisible_by(numbers, divisor):
    factors = []
    for divisible in numbers:
        if divisible%divisor == 0:
            factors.append(divisible)
          
    return factors 

def divisible_by(numbers, divisor):
    list = []
    for i in numbers:
        if i % divisor == 0:
            list.append(int(i))
    return list

def divisible_by(numbers, divisor):
    a = []
    for x in numbers:
        if x%divisor==0:
            a.append(x)
        else:
            pass
    return a

def divisible_by(numbers, divisor):
    result = []
    for digit in numbers:
        if digit%divisor == 0: result.append(digit)
    return result

def divisible_by(numbers, divisor):
    lista = []
    for n in numbers:
        if n % divisor == 0:
            lista.append(n)
    return lista

def divisible_by(numbers, divisor):
    arr1 =[]
    for num in numbers:
        if(num%divisor == 0):
            arr1.append(num)
    return arr1

def divisible_by(numbers, divisor):
    return [ el for el in numbers if el % divisor == 0]

def divisible_by(numbers, divisor):
    i = 0
    check = []
    
    while i < len(numbers):        

        if (numbers[i] % divisor) == 0:
            check.append(numbers[i])
            
        i += 1
        
    return check

divisible_by = lambda l,n:[x for x in l if not x%n]

def divisible_by(numbers, divisor):
    arr = []
    for el in numbers:
        if el % divisor==0:
            arr.append(el)
    return arr


def divisible_by(numbers, divisor):
    z =[]
    for k in numbers:
        if k % divisor == 0:
            z.append(k)
    return z

def divisible_by(numbers, divisor):
    listnew = []
    for x in numbers:
        if x % divisor == 0:
            listnew.append(x)
    return listnew

def divisible_by(numbers: list, divisor: int) -> list:
    """This function returns all numbers which are divisible by the given divisor."""
    if numbers is None:
        return []
    res = []
    for item in numbers:
        if item % divisor == 0:
            res.append(item)
    return res

def divisible_by(nums, divisor):
    return [el for el in nums if el % divisor == 0 ]

def divisible_by(numbers, divisor):
    return list(filter(lambda el: not(el % divisor), numbers))

def divisible_by(numbers, divisor):
    return list(filter(lambda numbers: not(numbers % divisor), numbers))

def divisible_by(numbers, divisor):
    '''just use list comprehension daughter'''
    return [number  for number in numbers if number%divisor==0]

def divisible_by(a, b):
    return [*filter(lambda n: n % b == 0, a)]

def divisible_by(numbers, divisor):
    num_list = []
    for n in numbers:
        if n % divisor == 0:
            num_list.append(n)
    return num_list


def divisible_by(numbers, divisor):
    return [x for x in numbers if x % divisor == 0]
    #return list(filter(lambda x: x % divisor == 0, numbers))


def divisible_by(numbers, divisor):
    divisible_nums = []
    for i in numbers:
        if i % divisor == 0:
            divisible_nums.append(i)
            
    return divisible_nums

def divisible_by(numbers, divisor):
    l1=[]
    for i in range(len(numbers)):
        if numbers[i]%divisor==0:
            l1.append(numbers[i])
    return l1


def divisible_by(numbers, divisor):
    return list(map(int,filter(lambda number:number%divisor==0,numbers)))

def divisible_by(numbers, divisor):
    result = []
    
    for el in numbers:
        if not el % divisor:
            result.append(el)
            
    return result

def divisible_by(numbers, divisor):
    list1=[]
    for i in range (len(numbers)+1):
        if i % divisor == 0 and i in numbers :
                list1.append(i)
    return list1

def divisible_by(numbers, divisor):
    x = []
    for i in range(len(numbers)):
        if numbers[i] % divisor == 0:
            x.append(numbers[i])
        else:
            x = x
    return x

def divisible_by(numbers, divisor):
    liste = []
    for i in range(0,len(numbers)):
        if numbers[i] % divisor == 0:
            liste.append(numbers[i])
            i += 1
    return liste

divisible_by = lambda numbers, divisor: list(n for n in numbers if n % divisor == 0) 

def divisible_by(numbers, divisor):
    lst= list()
    for number in numbers:
        if number % divisor == 0:
            lst.append(number)
    return lst

def divisible_by(numbers: list, divisor: int) -> list:
    return [x for x in numbers if x % divisor == 0]

def divisible_by(numbers, divisor):
    divList = []
    for i in range(len(numbers)): 
        if numbers[i] % divisor == 0: 
            divList.append(numbers[i])
    return divList

def divisible_by(numbers, divisor):
    new = list()
    for i in numbers:
        if i % divisor == 0:
            new.append(i)
    return new

def divisible_by(numbers, divisor):
    """
        Returns all numbers which are divisible by 'divisor'.
    """
    return [number for number in numbers if not number % divisor]

def divisible_by(numbers, divisor):
    arr = []
    for element in numbers:
        if element % divisor == 0:
            arr.append(element)
    return arr

def divisible_by(numbers, divisor):
    output = []
    for element in numbers:
        if element % divisor == 0:
            output.append(element)
    return output

def divisible_by(numbers, divisor):
    res = []
    for i in numbers:
        if not i % divisor:
            res.append(i)
    return res

def divisible_by(n, d):
    result = []
    for x in n:
        if x%d==0 :
            result.append(x)
    return result

def divisible_by(numbers, divisor):
    a = []
    for el in numbers:
        if el % divisor == 0:
            a.append(el)
    return a

def divisible_by(numbers, divisor):
    div=[]
    for i in numbers:
        if i%divisor == 0:
            h=i/divisor
            div.append(i)
    return div

def divisible_by(numbers, divisor):
    multiples = []
    for num in numbers:
        if num % divisor == 0:
            multiples.append(num)
    
    return multiples

def divisible_by(numbers, divisor):
    hold = []
    for i in range(len(numbers)):
        if numbers[i] % divisor == 0:
            hold.append(numbers[i])
    return hold

def divisible_by(numbers, divisor):
    i=0
    a =[]
    for item in numbers :
        if item%divisor ==0:
            a.insert(i,item)
            i+=1
            
    return a

def divisible_by(numbers, divisor):
    #numbers
    _ =         filter(lambda num: num % divisor == 0,                     numbers)

    return list(_)

def divisible_by(numbers, divisor):
    emptylist = []
    for eachnumber in numbers:
        if eachnumber % divisor == 0:
            emptylist.append(eachnumber)
    return emptylist

def divisible_by(numbers, divisor):
    new=[]
    for item in numbers:
        if item%divisor==0:
            new.append(item)
    return new

def divisible_by(numbers, divisor):
    n = []
    for x in numbers:
        if x%divisor==0:
            n.append(x)
    return n

def divisible_by(numbers, divisor):
    n_num = []
    for i in numbers:
        if i % divisor == 0:
            n_num.append(i)
    return n_num

def divisible_by(arr, div):
    return [x for x in arr if x % div == 0]

def divisible_by(l, n):
    return [e for e in l if e%n==0]

def divisible_by(numbers, divisor):
    mt = []        
    [mt.append(x) for x in numbers if x % divisor == 0]
    return mt

def divisible_by(numbers, divisor):
    c = []
    for number in numbers:
        if number % divisor == 0:
            c.append(number)
    return c

def divisible_by(numbers, divisor):
    lst = []
    for n in numbers:
        if n % divisor == 0:
            lst += [n]
    return lst

def divisible_by(numbers, divisor):
    lst = []
    for i in numbers:
        if i % divisor == False:
            lst.append(i)
    return lst

def divisible_by(numbers, divisor):
    divisors = []
    for i in range(len(numbers)):
        if numbers[i] % divisor == 0:
            divisors.append(numbers[i])
    return divisors

def divisible_by(numbers, divisor):
    wf = [] 
    dhf = [numbers, divisor]
    for i in numbers:
        if (i / divisor) == (i // divisor):
            wf.append(i)
    return wf

def divisible_by(numbers, divisor):
    """(list<int> -> list<int>)
    Returns the list of members of numbers list divisible by the passed divisor.
    >>> [1,2,3,4,5,6], 3)
    [3,6]
    
    >>> [1,3,5], 2)
    []
    
    >>> [0], 4)
    [0]
    """
    divisibleNums = []
    for num in numbers:
        if((num % divisor) == 0):
            divisibleNums.append(num)

    return divisibleNums

def divisible_by(numbers, divisor):
    l=[]
    l=numbers
    c=[]
    for i in l:
        if(i%divisor==0):
            c.append(i)
    return c

def divisible_by(numbers, divisor):
    return list(numbers[i] for i in range (len(numbers)) if numbers[i]%divisor==0)

def divisible_by(numbers, divisor):
    s = list()
    for i in numbers:
        if i % divisor == 0 :
            s.append(i)
    return s

def divisible_by(numbers, divisor):
    v=0
    answer = []
    while len(numbers) != v:
        if (numbers[v] % divisor) == 0:
            answer.append(numbers[v])
            v= v+1
        else:
            v=v+1
    return answer