You are given an array of non-negative integers, your task is to complete the series from 0 to the highest number in the array.

If the numbers in the sequence provided are not in order you should order them, but if a value repeats, then you must return a sequence with only one item, and the value of that item must be 0. like this:
```
inputs        outputs
[2,1]     ->  [0,1,2]
[1,4,4,6] ->  [0]
```
Notes: all numbers are positive integers.

This is set of example outputs based on the input sequence.
```
inputs        outputs
[0,1]   ->    [0,1]
[1,4,6] ->    [0,1,2,3,4,5,6]
[3,4,5] ->    [0,1,2,3,4,5]
[0,1,0] ->    [0]
```

Source: codewars | Difficulty: EASY
Tags: Fundamentals

Data structures

Starter code: def complete_series(seq):
	

Solutions:
def complete_series(a):
	return list(range(max(a) + 1)) if len(a) == len(set(a)) else [0]


def complete_series(seq):
	from collections import Counter
	if Counter(seq).most_common()[0][1] > 1:
		return [0]
	return [i for i in range(max(seq) + 1)]


def complete_series(seq):
	return list(range(1 + (len(seq) == len(set(seq)) and max(seq))))


complete_series = lambda s: list(range(max(s) + 1)) if len(set(s)) == len(s) else [0]


def complete_series(seq):
	if len(seq) > len(set(seq)):
		return [0]
	return list(range(max(seq) + 1))


def complete_series(s):
	if len(list(set(s))) == len(s):
		return [d for d in range(max(s) + 1)]
	else:
		return [0]


def complete_series(seq):
	seq.sort()
	if len(seq) == len(set(seq)):
		return [number for number in range(seq[-1] + 1)]
	else:
		return [0]