4th Highest Element

Easy

0/40

Contributed by

10 upvotes

Asked in companies

Problem statement

Given an array 'ARR' of 'N' integers. Find the fourth highest element present in the give 'ARR'. Return the minimum value of an integer which is -2147483648 if there it does not exists.

Detailed explanation ( Input/output format, Notes, Images )

Input format:

The first line of input contains the integer 'N' representing the size of the array.

The second line of input contains N space-separated integers representing the array elements.

Output Format:

The only output line contains the fourth-largest element if present, otherwise print -2147483648

Note:

You are not required to explicitly print the output, it has already been taken care of. Just implement the function.

Constraints :

1 <= N < 10^6
-10^6 <= ARR[i] <= 10^6

Where 'ARR[i]' denotes the 'ARR' element at 'ith' position.

Time Limit: 1 sec

Sample Input 1:

5
3 5 1 3 1

Sample Output 1:

Explanation Of Sample Input 1:

5 is the largest element, 3 is the second-largest element, again we have a 3 so it's the third largest and 1 is the fourth-largest, hence the answer 1.

Sample Input 2:

4
9 9 9 9

Sample Output 2:

Approaches (1)

Approach 1

Using Priority Queue

Time Complexity

Space Complexity

(100% EXP penalty)

4th Highest Element

Console