Corrected the invalid answer: Have implemented the program to find whether the array can be made strictly increasing using the values from another array.

Author: rajgohil07

.idea/workspace.xml

@@ -57,25 +57,10 @@ public static void main(String[] args) {
                 ans = -1;
             }
         }
-        // Check for the last index.
-        if (ans != -1 && arr1[arr1.length - 2] >= arr1[arr1.length - 1]) {
-            boolean isValueFounded = false;
-            for (int j : arr2) {
-                if (arr1[arr1.length - 2] < j) {
-                    arr1[arr1.length - 1] = j;
-                    isValueFounded = true;
-                    ans++;
-                    break;
-                }
-            }
-            if (!isValueFounded) {
-                ans = -1;
-            }
-        }
-
 
         if (ans != -1) {
             for (int i = 1; i < arr1.length - 1; i++) {
+
                 if (arr1[i] >= arr1[i + 1]) {
                     boolean isValueFounded = false;
                     if (initialValueChangedIndex != i) {
@@ -108,6 +93,22 @@ public static void main(String[] args) {
             }
         }
 
+        // Check for the last index.
+        if (ans != -1 && arr1[arr1.length - 2] >= arr1[arr1.length - 1]) {
+            boolean isValueFounded = false;
+            for (int j : arr2) {
+                if (arr1[arr1.length - 2] < j) {
+                    arr1[arr1.length - 1] = j;
+                    isValueFounded = true;
+                    ans++;
+                    break;
+                }
+            }
+            if (!isValueFounded) {
+                ans = -1;
+            }
+        }
+
         // Display the result.
         if (ans > 0) {
             System.out.println("Yes, array can be made strictly increasing using the values from another array.");