Want to solve this problem? Login now to get access to solve the problems

Problem

Submissions

Solution

Leaderboard

Coming soon

7

Difficulty: EASY

Avg. time to solve

15 min

Success Rate

90%

Problem Statement

Suggest Edit

```
1. All the elements are in the range 0 to N - 1.
2. The elements may not be in sorted order.
3. You can return the duplicate elements in any order.
4. If there are no duplicates present then return an empty array.
```

```
The first line of the input contains an integer T, denoting the number of test cases.
The first line of each test case contains the integer N, denoting the size of the array.
The second line of each test case contains N space-separated integers denoting the array elements.
```

```
For each test case, every line of output contains K space-separated integers denoting the duplicate elements in the array.
```

```
You do not need to print anything, it has already been taken care of. Just implement the given function.
```

```
1 <= T <= 100
1 <= N <= 10^4
0 <= Arr[i] <= N - 1
Time Limit: 1 sec
```

```
3
5
0 2 1 2 3
7
3 2 1 3 2 1 5
3
0 1 2
```

```
2
1 2 3
-1
```

```
For the first test case, since 2 is the only duplicate element, so we return it.
For the second test case, since 1, 2, 3 are duplicates so we return them. Note that 2, 3, 1 and 3, 2, 1 are also acceptable.
For the third test case, since there are no duplicates we return -1.
```

Want to solve this problem? Login now to get access to solve the problems