@@ -0,0 +1,1641 @@
+import java.io.*;%0Aimport java.math.*;%0Aimport java.security.*;%0Aimport java.text.*;%0Aimport java.util.*;%0Aimport java.util.concurrent.*;%0Aimport java.util.regex.*;%0A%0Apublic class Solution %7B%0A%0A    // Complete the countingSort function below.%0A    static int%5B%5D countingSort(int%5B%5D arr) %7B%0A        int%5B%5D k = new int%5B100%5D;%0A        for(int i=0;i%3Carr.length;i++)%7B%0A            k%5Barr%5Bi%5D%5D++;%0A        %7D%0A        int index = 0;%0A        for(int i=0;i%3C100;i++)%7B%0A            if(k%5Bi%5D!=0)%7B%0A                int t = k%5Bi%5D;%0A                while(t!=0)%7B%0A                    arr%5Bindex++%5D = i;%0A                    t--;%0A                %7D%0A            %7D%0A        %7D%0A        return arr;%0A%0A    %7D%0A%0A    private static final Scanner scanner = new Scanner(System.in);%0A%0A    public static void main(String%5B%5D args) throws IOException %7B%0A        BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv(%22OUTPUT_PATH%22)));%0A%0A        int n = scanner.nextInt();%0A        scanner.skip(%22(%5Cr%5Cn%7C%5B%5Cn%5Cr%5Cu2028%5Cu2029%5Cu0085%5D)?%22);%0A%0A        int%5B%5D arr = new int%5Bn%5D;%0A%0A        String%5B%5D arrItems = scanner.nextLine().split(%22 %22);%0A        scanner.skip(%22(%5Cr%5Cn%7C%5B%5Cn%5Cr%5Cu2028%5Cu2029%5Cu0085%5D)?%22);%0A%0A        for (int i = 0; i %3C n; i++) %7B%0A            int arrItem = Integer.parseInt(arrItems%5Bi%5D);%0A            arr%5Bi%5D = arrItem;%0A        %7D%0A%0A        int%5B%5D result = countingSort(arr);%0A%0A        for (int i = 0; i %3C result.length; i++) %7B%0A            bufferedWriter.write(String.valueOf(result%5Bi%5D));%0A%0A            if (i != result.length - 1) %7B%0A                bufferedWriter.write(%22 %22);%0A            %7D%0A        %7D%0A%0A        bufferedWriter.newLine();%0A%0A        bufferedWriter.close();%0A%0A        scanner.close();%0A    %7D%0A%7D%0A

add CountingSort2.java