Array Practice Challenge

Hard Arrays PRO

🔒 Login to Unlock

Problem Statement

Write a C program to find the majority element (an element that appears more than n/2 times) in an array, or print -1 if no majority element exists.

Input Format

First line contains n. Second line contains n elements.

Output Format

Print the majority element or -1.

Constraints

1 <= n <= 100

Sample Input

7
3 3 4 2 4 4 4

Sample Output

Explanation

Count frequencies of each element or use Boyer-Moore Voting algorithm to find the element appearing more than n/2 times.

Starter Code

#include <stdio.h>

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

Limits

Time Limit: 1s
Memory Limit: 256MB

🔒 Login to Unlock