A majority element is an element that occurs more than floor('N' / 2) times in the array.
The first line of input contains an integer 'T' representing the number of test cases. The first line of each test case contains a single positive integer ‘N’ representing the size of the array/list. The second line of each test case contains ‘N’ single space-separated integers representing the array elements of 'ARR'.
For each test case, print an integer denoting the majority element present in the array. Print-1 in case of no majority element.
You don't need to print the output, it has already been taken care of. Just implement the given function.
1 <= T <= 100 1 <= N <= 5 * 10^3 -10^5 <= ARR[i] <= 10^5 Where 'ARR[i]' denotes the element at the 'i'th index in the array/list 'ARR'. Time limit: 1 sec
Longest Subarray With Zero Sum
Merge Two Sorted Arrays Without Extra Space
Ninja And The Strictly Increasing Array
Negative To The End