public static List<Integer> countingSort(List<Integer> arr) {
        List<Integer> result = new ArrayList<>();
        for (int i = 0; i < 100; i++) {
            result.add(Collections.frequency(arr, i));
        }
        return result;
    }

def countingSort(arr):
    if n >= 100 and n <= 10**6:  # First constrain
        frecuency_array = []
        for i in range(100):
            frecuency_array.append(arr.count(i))
            if arr[i] < 0 or arr[i] >= 100:  # Second constrain
                raise ValueError('Second constrain violated')
    else:
        raise ValueError('First constrain violated')
    return frecuency_array

def countingSort(arr):
    freq = [0] * n
    for i in arr:
        freq[i] += 1
    return freq[:100]

func countingSort(arr: [Int]) -> [Int] {
    // Write your code here
    var counterArray = [Int](repeating: 0, count: 100) 
    for i in 0..<arr.count {
        counterArray[arr[i]] += 1
    }
    return counterArray
}