Majority Element

import java.util.*;
class Solution {
    public int majority_element(int[] nums) {
        Map<Integer, Integer> freq = new HashMap<>();
        int limit = nums.length / 2;
        for (int x : nums) {
            freq.put(x, freq.getOrDefault(x, 0) + 1);
            if (freq.get(x) > limit) return x;
        }
        return nums.length > 0 ? nums[0] : 0;
    }
}

function majority_element(nums) {
    const freq = {};
    const limit = Math.floor(nums.length / 2);
    for (let i = 0; i < nums.length; i++) {
        const x = nums[i];
        freq[x] = (freq[x] || 0) + 1;
        if (freq[x] > limit) return x;
    }
    return nums.length ? nums[0] : 0;
}

<?php
function majority_element($nums) {
    $freq = [];
    $limit = intdiv(count($nums), 2);
    foreach ($nums as $x) {
        $k = (string)$x;
        $freq[$k] = ($freq[$k] ?? 0) + 1;
        if ($freq[$k] > $limit) return $x;
    }
    return count($nums) ? $nums[0] : 0;
}
?>

from typing import List

def majority_element(nums: List[int]) -> int:
    freq = {}
    limit = len(nums) // 2
    for x in nums:
        freq[x] = freq.get(x, 0) + 1
        if freq[x] > limit:
            return x
    return nums[0] if nums else 0

use std::collections::HashMap;
fn majority_element(nums: Vec<i32>) -> i32 {
    let mut freq: HashMap<i32, i32> = HashMap::new();
    let limit = (nums.len() / 2) as i32;
    for x in nums.iter() {
        let c = freq.entry(*x).or_insert(0);
        *c += 1;
        if *c > limit {
            return *x;
        }
    }
    if nums.is_empty() { 0 } else { nums[0] }
}

function majority_element(nums: number[]): number {
    var freq: { [key: string]: number } = {};
    var limit = Math.floor(nums.length / 2);
    for (var i = 0; i < nums.length; i++) {
        var x = nums[i];
        var key = String(x);
        freq[key] = (freq[key] || 0) + 1;
        if (freq[key] > limit) return x;
    }
    return nums.length ? nums[0] : 0;
}