Majority Element Problem Statement

Given an array/list 'ARR' consisting of 'N' integers, your task is to find the majority element in the array. If there is no majority element present, return -1.

Example:

Input:

T = 2
N = 3
ARR = [3, 3, 4]
N = 5
ARR = [1, 1, 2, 2, 2]

Output:

3
2

Explanation:

For the first test case, majority element is 3 as it appears more than floor(3/2) = 1 times. For the second, 2 is the majority element as it appears more than floor(5/2) = 2 times.

Constraints:

• 1 <= T <= 100
• 1 <= N <= 5 * 10³
• -10⁵ <= ARR[i] <= 10⁵

Time limit: 1 sec

Note:

A majority element is an element that occurs more than floor(N / 2) times in the array. The output is managed by the system; you only need to implement the function to find the majority element.