find the kth least common element in an array in python

main.py
import heapq

def kth_least_common_element(arr, k):
    # sort the array in ascending order
    arr.sort()
    
    # create a heap to keep track of the frequency of each element in the array
    freq_heap = []
    heapq.heapify(freq_heap)
    
    # create a set of unique elements in the array
    unique_set = set(arr)
    
    # iterate through the elements in the array, updating the frequency count in the heap
    for num in unique_set:
        freq = arr.count(num)
        heapq.heappush(freq_heap, (freq, num))
    
    # use the heap to create a list of tuples where the first element of the tuple is the frequency count, and the second element is the value of the element
    freq_list = []
    while freq_heap:
        freq, num = heapq.heappop(freq_heap)
        freq_list.append((freq, num))
    
    # sort the list of tuples in ascending order based on the frequency count
    freq_list.sort()
    
    # return the kth least common element
    return freq_list[k-1][1]
987 chars
30 lines

main.py
>>> arr = [4, 2, 1, 4, 4, 3, 1, 2, 2]
>>> kth_least_common_element(arr, 2)
2
77 chars
4 lines