find the kth most frequent element in an array in csharp

main.cs
public static int FindKthMostFrequent(int[] arr, int k)
{
    // Create a dictionary to store the frequency of each element
    Dictionary<int, int> freqDict = new Dictionary<int, int>();
    foreach (int num in arr)
    {
        if (freqDict.ContainsKey(num))
        {
            freqDict[num]++;
        }
        else
        {
            freqDict[num] = 1;
        }
    }

    // Sort the dictionary by its values in descending order
    var sortedDict = freqDict.OrderByDescending(x => x.Value);

    // Return the kth key in the sorted dictionary
    return sortedDict.ElementAt(k - 1).Key;

    // Note that if k is larger than the number of distinct elements in the array,
    // this implementation will throw an exception. You can add additional checks to
    // handle this case if necessary.
}
811 chars
27 lines

main.cs
public static int FindKthMostFrequent(int[] arr, int k)
{
    // Create a lookup to store the frequency of each element
    var freqLookup = arr.ToLookup(x => x);

    // Get the kth most frequent element using LINQ
    int kthElement = freqLookup.OrderByDescending(g => g.Count()).ElementAt(k - 1).Key;

    return kthElement;
}
330 chars
11 lines