Arrays.sort(s, 0, n, (a, b) -> new BigDecimal(b).compareTo(new BigDecimal(a)));

This is a really interesting challenge! It’s a great way to test understanding of both BigDecimal operations and stable sorting in Java. playexchange

This is a really interesting challenge that shows the true power of Java’s BigDecimal class. ekbet 60 login

import java.math.BigDecimal; import java.util.*; class Solution{

public static void main(String []args){
    //Input
    Scanner sc= new Scanner(System.in);
    int n=sc.nextInt();
    String []s=new String[n+2];
    for(int i=0;i<n;i++){
        s[i]=sc.next();
    }
    sc.close();

for (int i=n; i>=0; i--) { for (int j=0; j

            if (numA.compareTo(numB) == -1) {
                String tmp = s[j];

                s[j] = s[j+1];
                s[j+1] = tmp;
            }
        }
    }


    //Output
    for(int i=0;i<n;i++)
    {
        System.out.println(s[i]);
    }
}

}

Arrays.sort(s, 0, n, (String a,String b) ->{return new BigDecimal(b).compareTo(new BigDecimal(a));});