In this Kata, you will be given an array of numbers in which two numbers occur once and the rest occur only twice. Your task will be to return the sum of the numbers that occur only once. 

For example, `repeats([4,5,7,5,4,8]) = 15` because only the numbers `7` and `8` occur once, and their sum is `15`.

More examples in the test cases. 


```if:csharp
Documentation:
Kata.Repeats Method (List<Int32>)

Takes a list where all ints are repeated twice, except two ints, and returns the sum of the ints of a list where those ints only occur once.

Syntax


public
static
int Repeats(
List<int> source
    )
  



Parameters

source

Type: System.Collections.Generic.List<Int32>
The list to process.

Return Value

Type: System.Int32
  The sum of the elements of the list where those elements have no duplicates.

```


Good luck!

If you like this Kata, please try: 

[Sum of prime-indexed elements](https://www.codewars.com/kata/59f38b033640ce9fc700015b)

[Sum of integer combinations](https://www.codewars.com/kata/59f3178e3640cef6d90000d5)

Source: codewars | Difficulty: EASY

Starter code: def repeats(arr):
	

Solutions:
def repeats(arr):
	return sum([x for x in arr if arr.count(x) == 1])


from collections import Counter

def repeats(arr):
	return sum((k for (k, v) in Counter(arr).items() if v == 1))


def repeats(arr):
	return sum((n for n in arr if arr.count(n) == 1))


def repeats(arr):
	single = []
	for i in arr:
		if arr.count(i) == 1:
			single.append(i)
	total = sum(single)
	return total


repeats = lambda a: 2 * sum(set(a)) - sum(a)


def repeats(s):
	numbers = set()
	for number in s:
		if number in numbers:
			numbers.remove(number)
		else:
			numbers.add(number)
	return sum(numbers)


def repeats(arr):
	return sum(filter(lambda num: arr.count(num) == 1, arr))


def repeats(arr):
	return sum((num for num in arr if arr.count(num) == 1))


def repeats(a):
	return sum(filter(lambda x: a.count(x) < 2, a))


def repeats(arr):
	return sum((i for i in arr if arr.count(i) == 1))