Unique Maximum Number
Practice
3.8 (12 votes)
Hash table
Hashmap
Basic programming
Easy
Open
Approved
Problem
73% Success 6258 Attempts 20 Points 5s Time Limit 256MB Memory 1024 KB Max Code
Given an array A. Find the highest unique element in array A. Unique element means that element should present only once in the array.
Input:
First line of input contains N, size of array A. Next line contains N space separated elements of array A.
Output:
Print highest unique number of array A. If there is no any such element present in array then print -1.
Constraints:
1 ≤ N ≤ 106
0 ≤ Ai ≤ 109
Explanation
In array A:
9 occur two times. 8 occur two times. 5 occur once hence the answer is 5.
Code Editor
Please login to use the editor
You need to be logged in to access the code editor
Loading...
Please wait while we load the editor
Results
Custom Input
Run your code to see the output
Submissions
Please login to view your submissions
Similar Problems
Points:20
6 votes
Tags:
Dynamic ProgrammingHash functionImplementationData StructuresAlgorithmsHash tableOpenApprovedEasy
Points:20
9 votes
Tags:
OpenApprovedHashingEasy
Points:20
9 votes
Tags:
Hash functionAd-HocImplementationHash tableOpenApprovedEasy
Editorial
Login to unlock the editorial
Please login to use the editor
You need to be logged in to access the code editor
Loading...
Please wait while we load the editor
Results
Custom Input
Run your code to see the output