From bfb7514bbe91c199625de428859249161fcac530 Mon Sep 17 00:00:00 2001
From: madHEYsiaOYO <39955184+madHEYsiaOYO@users.noreply.github.com>
Date: Sat, 13 Oct 2018 11:19:08 +0530
Subject: [PATCH 1/2] Create formLargestNumberFromArray

---
 formLargestNumberFromArray | 66 ++++++++++++++++++++++++++++++++++++++
 1 file changed, 66 insertions(+)
 create mode 100644 formLargestNumberFromArray

diff --git a/formLargestNumberFromArray b/formLargestNumberFromArray
new file mode 100644
index 0000000..dbd9306
--- /dev/null
+++ b/formLargestNumberFromArray
@@ -0,0 +1,66 @@
+// Input:
+// 
+// 2
+// 5
+// 3 30 34 5 9
+// 4
+// 54 546 548 60
+
+// Output:
+//
+// 9534330
+// 6054854654
+
+
+import java.util.*;
+import java.text.*;
+import java.math.*;
+import java.util.regex.*;
+
+class largestNumber
+{
+    public static String A[];
+    public static void main (String[] args)
+    {
+        Scanner in = new Scanner(System.in);
+        int test = in.nextInt();
+        for(int t=0;t<test;++t){
+            int n = in.nextInt();
+            A = new String[n];
+            for(int i=0;i<n;++i)
+                A[i] = in.next();
+            Arrays.sort(A);
+            // for(int i=0;i<n;++i)
+            //     System.out.print(A[i]+" ");
+            // System.out.println();
+            
+            int index = 0; 
+            int i=1;
+            for(;i<n;++i)
+                if(A[i].charAt(0)!=A[index].charAt(0)){
+                    if((i-index)>1)
+                        rearrange(index,i-1);
+                    index = i;
+                }
+            rearrange(index,i-1);
+            for(i=n-1;i>=0;--i)
+                System.out.print(A[i]);
+            System.out.println();
+        }
+    }
+    public static void rearrange(int start, int end){
+        for(int i=start+1;i<=end;++i){
+            // System.out.print("arranging "+A[i]+" >> ");
+            int j=i-1;
+            inner:for(;j>=start;--j)
+                if(((A[j]+A[i]).compareTo(A[i]+A[j]))<=0)
+                    break inner;
+            // System.out.println("before "+A[j+1]);
+            String key = A[i];
+            for(int k=i;k>j+1;--k)
+                A[k] = A[k-1];
+            A[j+1] = key; 
+        }
+    }
+}
+

From d3e5e6e7904c73978889869bb73c9c6c8e970384 Mon Sep 17 00:00:00 2001
From: madHEYsiaOYO <39955184+madHEYsiaOYO@users.noreply.github.com>
Date: Sat, 13 Oct 2018 11:24:32 +0530
Subject: [PATCH 2/2] updates

---
 formLargestNumberFromArray => formLargestNumberFromArray.java | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)
 rename formLargestNumberFromArray => formLargestNumberFromArray.java (97%)

diff --git a/formLargestNumberFromArray b/formLargestNumberFromArray.java
similarity index 97%
rename from formLargestNumberFromArray
rename to formLargestNumberFromArray.java
index dbd9306..7259a66 100644
--- a/formLargestNumberFromArray
+++ b/formLargestNumberFromArray.java
@@ -17,7 +17,7 @@
 import java.math.*;
 import java.util.regex.*;
 
-class largestNumber
+class formLargestNumberFromArray
 {
     public static String A[];
     public static void main (String[] args)