Majority Element

Medium Algorithmic Challenges

Solve in Playground →

Problem Statement

Given an array of size N, find the majority element (element that appears more than N/2 times).

Input Format

First line contains N. Second line contains N space-separated integers.

Output Format

Print the majority element.

Constraints

1 <= N <= 1000

Sample Input

3
3 2 3

Sample Output

Explanation

3 appears 2 times out of 3, which is more than N/2.

Starter Code

#include <stdio.h>

int main() {
    int n;
    if (scanf("%d", &n) == 1) {
        int arr[n];
        for (int i = 0; i < n; i++) scanf("%d", &arr[i]);
        // Write your code here
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →