# Remove Duplicates

You are to write a function called `unique` that takes an array of integers and returns the array with duplicates removed. It must return the values in the same order as first seen in the given array. Thus no sorting should be done, if 52 appears before 10 in the given array then it should also be that 52 appears before 10 in the returned array.

## Assumptions

* All values given are integers (they can be positive or negative).
* You are given an array but it may be empty.
* They array may have duplicates or it may not.

## Example

```python
print unique([1, 5, 2, 0, 2, -3, 1, 10])
[1, 5, 2, 0, -3, 10]

print unique([])
[]

print unique([5, 2, 1, 3])
[5, 2, 1, 3]
```

Source: codewars | Difficulty: EASY

Starter code: def unique(integers):
	

Solutions:
from collections import OrderedDict

def unique(integers):
	return list(OrderedDict.fromkeys(integers))


def unique(integers):
	l = []
	for i in integers:
		if not i in l:
			l.append(i)
	return l


def unique(integers):
	ans = []
	for x in integers:
		if x not in ans:
			ans.append(x)
	return ans


def unique(integers):
	result = []
	for number in integers:
		if number not in result:
			result.append(number)
	return result


def unique(integers):
	return list(dict.fromkeys(integers))


def unique(integers):
	return sorted(set(integers), key=integers.index)


def unique(integers):
	seen = set()
	return [x for x in integers if not (x in seen or seen.add(x))]


def unique(integers):
	return [value for (i, value) in enumerate(integers) if value not in integers[:i]]


def unique(integers):
	dedupe = set()
	return [i for i in integers if i not in dedupe and (not dedupe.add(i))]