View difference between Paste ID: SF09E7Rf and YxWZDY91

 // Author : Saurav Kalsoor
-// Sort By Digit Sum - JAVA
+// Sort By Reversing Digits - JAVA
 
 import java.util.*;
 
 public class Test {
 
     static Scanner sc = new Scanner(System.in);
     public static void main(String[] args) {
         int n = sc.nextInt();
         ArrayList<Integer> arr = new ArrayList<>();
 
         for(int i=0; i < n; i++) {
             int input = sc.nextInt();
             arr.add(input);
         }
 
         ArrayList<Integer> result = sortByDigits(arr);
 
         for(int i=0; i < n; i++)
             System.out.print(result.get(i) + " ");
 
         System.out.println();
     }
 
     public static ArrayList<Integer> sortByDigits(ArrayList<Integer> arr){
-        Collections.sort(arr, new SortBySumOfDigits());
+        Collections.sort(arr, new SortByReversingDigits());
         return arr;
     }
 }
 
-class SortBySumOfDigits implements Comparator<Integer> {
+class SortByReversingDigits implements Comparator<Integer> {
 
     public int compare(Integer a, Integer b){
 
-        int sumA = getSum(a), sumB = getSum(b);
+        int revA = reverseDigits(a), revB = reverseDigits(b);
-        if(sumA == sumB){
+        if(revA == revB){
             return a - b;
         }
         else{
-            return sumA - sumB;
+            return revA - revB;
         }
     }
 
-    public int getSum(int n){
+    public int reverseDigits(int n){
-        int sum = 0;
+        int rev = 0;
         while(n > 0){
-            sum = sum + n%10;
+            rev = rev * 10;
             rev = rev + n%10;
             n = n/10;
-        return sum;
+
         return rev;
     }
 }