Top K Frequent Elements

import java.util.*;
class Solution {
    public int[] top_k_frequent_elements(int[] nums, int k) {
        Map<Integer, Integer> freq = new HashMap<>();
        for (int x : nums) freq.put(x, freq.getOrDefault(x, 0) + 1);
        List<Map.Entry<Integer, Integer>> arr = new ArrayList<>(freq.entrySet());
        arr.sort((a, b) -> b.getValue() - a.getValue());
        int[] res = new int[k];
        for (int i = 0; i < k; i++) res[i] = arr.get(i).getKey();
        return res;
    }
}

function top_k_frequent_elements(nums, k) {
    const freq = {};
    for (let i = 0; i < nums.length; i++) {
        const x = nums[i];
        freq[x] = (freq[x] || 0) + 1;
    }
    const pairs = Object.keys(freq).map(key => [parseInt(key), freq[key]]);
    pairs.sort((a, b) => b[1] - a[1]);
    const res = [];
    for (let i = 0; i < k; i++) res.push(pairs[i][0]);
    return res;
}

<?php
function top_k_frequent_elements($nums, $k) {
    $freq = [];
    foreach ($nums as $x) {
        $key = (string)$x;
        $freq[$key] = ($freq[$key] ?? 0) + 1;
    }
    arsort($freq);
    $keys = array_keys($freq);
    $res = [];
    for ($i = 0; $i < $k; $i++) $res[] = intval($keys[$i]);
    return $res;
}
?>

from typing import List

def top_k_frequent_elements(nums: List[int], k: int) -> List[int]:
    freq = {}
    for x in nums:
        freq[x] = freq.get(x, 0) + 1
    pairs = sorted(freq.items(), key=lambda p: p[1], reverse=True)
    return [pairs[i][0] for i in range(k)]

use std::collections::HashMap;
fn top_k_frequent_elements(nums: Vec<i32>, k: i32) -> Vec<i32> {
    let mut freq: HashMap<i32, i32> = HashMap::new();
    for x in nums {
        *freq.entry(x).or_insert(0) += 1;
    }
    let mut arr: Vec<(i32, i32)> = freq.into_iter().collect();
    arr.sort_by(|a, b| b.1.cmp(&a.1));
    let mut res: Vec<i32> = Vec::new();
    for i in 0..k as usize {
        res.push(arr[i].0);
    }
    res
}

function top_k_frequent_elements(nums: number[], k: number): number[] {
    var freq: { [key: string]: number } = {};
    for (var i = 0; i < nums.length; i++) {
        var key = String(nums[i]);
        freq[key] = (freq[key] || 0) + 1;
    }
    var keys = Object.keys(freq);
    var pairs: [number, number][] = [];
    for (var j = 0; j < keys.length; j++) {
        pairs.push([parseInt(keys[j], 10), freq[keys[j]]]);
    }
    pairs.sort(function(a, b){ return b[1] - a[1]; });
    var res: number[] = [];
    for (var p = 0; p < k; p++) res.push(pairs[p][0]);
    return res;
}