1 Solution Optimized

Author: architg-op

Array/Merge Two Arrays.java

@@ -0,0 +1,39 @@
+/* package codechef; // don't place package name! */
+
+import java.util.*;
+import java.lang.*;
+import java.io.*;
+
+/* Name of the class has to be "Main" only if the class is public. */
+class Codechef
+{
+	public static void main (String[] args) throws java.lang.Exception
+	{
+	    int l[] = {1, 2, 4, 6};
+	    int r[] = {3, 5, 7, 8};
+	    int nL = l.length;
+	    int nR = r.length;
+	    int a[] = new int[nL + nR];
+	    int i = 0, j = 0, k = 0;
+	    while (i < nL && j < nR) {
+	        if (l[i] <= r[j]) {
+	            a[k] = l[i];
+	            i++;
+	        }
+	        else {
+	            a[k] = r[j]; 
+	            j++;
+	        }
+	        k++;
+	    }
+	    while (i < nL) {
+	        a[k++] = l[i++];
+	    }
+	    while (j < nR) {
+	        a[k++] = r[j++];
+	    }
+	    for (int m = 0; m < k; m++) {
+	        System.out.print(a[m] + " ");
+	    }
+	}
+}

Array/Next Greater number with same set of digits.java

@@ -0,0 +1,57 @@
+import java.util.*;
+import java.lang.*;
+import java.io.*;
+class GFG
+ {
+	public static void main (String[] args)
+	 {
+	     Scanner sc = new Scanner(System.in);
+	     int t = sc.nextInt();
+	     while (t-- != 0) {
+	         int n = sc.nextInt();
+	         int a[] = new int[n];
+	         for (int i = 0; i < n; i++) {
+	             a[i] = sc.nextInt();
+	         }
+	         int i = 0; 
+	         int f = 0;
+	         int r = a.length - 1;
+	         // Finding the Number which breakes the ascending order pattern from right
+    	     for (int j = a.length - 1; j > 0; j--) {
+	             if (a[j - 1] < a[j]) {
+	                 f = 1;
+	                 i = j - 1;
+	                 break;
+	             }
+	         }
+	         if (f == 1) {
+	             // Finding the Smallest number which is greater than a[i]
+	             int min = 1111;
+	             for (int q = i + 1; q < n; q++) {
+	                 if (a[q] > a[i] && a[q] < min) {
+	                     min = a[q];
+	                     r = q;
+	                 }
+	             }
+	             // Swapping numbers
+    	         int temp = a[i];
+    	         a[i] = a[r];
+    	         a[r] = temp;
+    	         // Sorting numbers
+    	         Arrays.sort(a, i + 1, n);
+    	         // Printing the numbers
+    	         for (int j = 0; j < a.length; j++) {
+    	             System.out.print(a[j] + " ");
+    	         }
+    	         System.out.println();
+	         }
+	         else {
+	         	// Printing in reverse order if the numbers are found in descending order
+	             for (i = a.length - 1; i >= 0; i--) {
+	                 System.out.print(a[i] + " ");
+	             }
+	         }
+	         f = 0;
+	     }
+	 }
+}