Try solving this problem in O(N) time complexity.
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.
The only output line contains the fourth-largest element if present, otherwise print -2147483648
You are not required to explicitly print the output, it has already been taken care of. Just implement the function.
1 <= N < 10^6
-10^6 <= element <= 10^6
Time Limit: 1 sec
Merge Two Sorted Arrays Without Extra Space
Search In A Sorted 2D Matrix
Ninja And The Strictly Increasing Array
Negative To The End
Fake Coin Problem