# Problem Definition

## Description

Remove duplicates and return list. Input list is unsorted. Solve for optimal time complexity.

```plaintext
Example:

Input: [1, 2, 1, 3, 2, 1, 2]
Output: [1, 2, 3]
```

## Notes