----
Vampire Numbers
----

Our loose definition of [Vampire Numbers](http://en.wikipedia.org/wiki/Vampire_number) can be described as follows:

```python
6 * 21 = 126
# 6 and 21 would be valid 'fangs' for a vampire number as the 
# digits 6, 1, and 2 are present in both the product and multiplicands

10 * 11 = 110
# 110 is not a vampire number since there are three 1's in the
# multiplicands, but only two 1's in the product
```

Create a function that can receive two 'fangs' and determine if the product of the two is a valid vampire number.

Difficulty: introductory

Starter code:

def vampire_test(x, y):
	

Solutions:
def vampire_test(x, y):
    return sorted(str(x * y)) == sorted(str(x) + str(y))

def vampire_test(x, y):
    return sorted(list(str(x) + str(y))) == sorted(list(str(x*y)))

from collections import Counter

def vampire_test(x, y):
    return Counter(str(x) + str(y)) == Counter(str(x * y))

def vampire_test(x, y):
  return "".join(sorted(list(str(x) + str(y)))) == "".join(sorted(list(str(x * y))))

def vampire_test(x, y):
    return (x > 0 or y > 0) and sorted(str(x) + str(y)) == sorted(str(x * y))

def vampire_test(x, y):
    return sorted(str(x)+str(y)) == sorted(str(x*y))

from collections import Counter
def vampire_test(x, y):
    return Counter(str(x)) + Counter(str(y)) == Counter(str(x*y))

def vampire_test(x, y):
    m = str(x*y)
    x=str(x)+str(y)
    if set(m) == set(x) and len(x)==len(m):
        return True
    return False


def vampire_test(x, y):
    return (str(x*y).count('1') == ((str(x).count('1')) + (str(y).count('1')))) & ((x > 0) | (y>0))

def vampire_test(x, y):
    return sorted(f"{x}{y}") == sorted(f"{x*y}")