New update is available. Click here to update.

Posted: 15 Sep, 2020

Difficulty: Moderate

```
1. Input will always have only two integers that appear exactly once rest will appear twice.
2. Try to do this in linear time and constant space.
```

```
The first line of input contains an integer N representing the size of the array.
The second line of input contains an N space-separated integers representing the array elements.
```

```
Print the two space-separated elements that appear only once where the first integer is less than the second integer.
```

```
2 <= N <= 10^5
-10^5 <= ARR[i] <= 10^5
Time Limit: 1 sec
```

SIMILAR PROBLEMS

Best time to buy and sell stock II

Posted: 5 Sep, 2022

Difficulty: Moderate

LRU Cache

Posted: 10 Sep, 2022

Difficulty: Moderate

Ninja And The Class Room

Posted: 19 Sep, 2022

Difficulty: Easy

Array Rotation

Posted: 21 Oct, 2022

Difficulty: Easy

Find The Single Element

Posted: 30 Oct, 2022

Difficulty: Easy

Categories:

Popular Courses: