New update is available. Click here to update.

Problem title
Difficulty
Avg time to solve

Maximum Subarray Sum
Hard
35 mins
Flower Shop
Easy
--
Swap Two Numbers
Easy
10 mins
Find Unique
Easy
--
Beautiful String
Easy
18 mins
Duplicate In Array
Easy
15 mins
Yogesh And Primes
Moderate
20 mins
First Missing Positive
Moderate
18 mins
First and Last Position of an Element In Sorted Array
Easy
15 mins

Find Unique

Easy
Share
441 upvotes

Problem Statement

You have been given an integer array/list(ARR) of size N. Where N is equal to [2M + 1].

Now, in the given array/list, 'M' numbers are present twice and one number is present only once.

You need to find and return that number which is unique in the array/list.

 Note:
Unique element is always present in the array/list according to the given condition.
Detailed explanation ( Input/output format, Notes, Constraints, Images )
Sample Input 1:
1
7
2 3 1 6 3 6 2
Sample Output 1:
1
Sample Input 2:
2
5
2 4 7 2 7
9
1 3 1 3 6 6 7 10 7
Sample Output 2:
4
10
Reset Code
Full screen
copy-code
Console