Runtime:6ms ,faster than 56.51% java submissions.

[Aarav238]

Done using "Boyer-Moore Majority Voting Algorithm"

[javadev]

1 ms solution

public class Solution {
    public int majorityElement(int[] arr) {
        int count = 1;
        int majority = arr[0];
        // For Potential Majority Element
        for (int i = 1; i < arr.length; i++) {
            if (arr[i] == majority) {
                count++;
            } else {
                if (count > 1) {
                    count--;
                } else {
                    majority = arr[i];
                }
            }
        }
        // For Confirmation
        count = 0;
        for (int j : arr) {
            if (j == majority) {
                count++;
            }
        }
        if (count >= (arr.length / 2) + 1) {
            return majority;
        } else {
            return -1;
        }
    }
}

[varunu28]

There is no problem on LeetCode with name as Majority Elements. There is a problem named as Majority Element that is solved using the candidate voting algorithm. Code

Please have a look at the existing solutions before opening a PR. Thanks