Given two arrays of integers `m` and `n`, test if they contain *at least* one identical element. Return `true` if they do; `false` if not.

Your code must handle any value within the range of a 32-bit integer, and must be capable of handling either array being empty (which is a `false` result, as there are no duplicated elements).

Difficulty: introductory

Starter code:

def duplicate_elements(m, n):
	

Solutions:
def duplicate_elements(m, n):
    return not set(m).isdisjoint(n)

def duplicate_elements(m, n):
    return any(x in n for x in m)

def duplicate_elements(m, n):
    return bool(set(m) & set(n))

def duplicate_elements(m, n):
    return bool(set(m).intersection(n))

def duplicate_elements(m, n):
    return True if [x for x in m if x in n] else False

def duplicate_elements(m, n):
    return any(map(set(n).__contains__, m))

def duplicate_elements(m, n):
    return any(i in m for i in n)

def duplicate_elements(m, n):
    return len(m + n) != len(set(m + n))

duplicate_elements=lambda a,b:bool(set(a)&set(b))

def duplicate_elements(m, n):
    for element in m:
        try:
            n.index(element)
            return True
        except:
            continue
    return False