Problem in the solution

#1

even when i copy and pasted the solution from the editorial,
then also only 1 test case is passing and rest have failed

#2

can you please post your code here.
Thanks

#3

import java.util.*; public class Main { public static Scanner scan = new Scanner(System.in); public static void main(String[] args) { Scanner scn = new Scanner(System.in); int tc = scn.nextInt(); while (tc > 0) { int n = scn.nextInt(); int[] arr = new int[n]; for (int i = 0; i < arr.length; i++) { arr[i] = scn.nextInt(); } sort(arr); display(arr); tc–; } } public static void display(int[] arr) { for (int val : arr) { System.out.print(val + “”); } System.out.println(); } public static int[] takeInput() { int len = scan.nextInt(); int[] arr = new int[len]; for (int i = 0; i < len; i++) { arr[i] = scan.nextInt(); } return arr; } public static void sort(int[] arr) { for (int i = 0; i < arr.length - 1; i++) { for (int j = 0; j < arr.length - i - 1; j++) { if (compare(arr[j], arr[j + 1]) > 0) { int temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = temp; } } } } public static int compare(int n1, int n2) { String val1 = n1 + “” + n2; String val2 = n2 + “” + n1; int val1int = Integer.valueOf(val1); int val2int = Integer.valueOf(val2); if (val1int > val2int) return -1; else return 1; } }

#4

are you getting TLE error? if yes, the problem is in your sorting algorithm, which is actually bubble sort, with a huge time complexity of O(n^2) . switch to merge or quick sort to get rid of TLE.
or you can use java’s sorting method. that is Collections.sort(), which can sort your numbers in a way you want with the help of Comparator.
Thanks

#5

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.