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

@@ -34,8 +34,8 @@ Given two integer arrays arr1 and arr2, return the minimum number of operations
 public class MakeArrayStrictlyIncreasing {
     public static void main(String[] args) {
         // Initialization.
-        int[] arr1 = {1, 5, 3, 6, 7};
-        int[] arr2 = {4, 3, 1};
+        int[] arr1 = {0, 11, 6, 1, 4, 3};
+        int[] arr2 = {5, 4, 11, 10, 1, 0};
         boolean isInitialValueChanged = false;
         int ans = 0;
 
@@ -56,24 +56,24 @@ public static void main(String[] args) {
             if (!isValueFounded) {
                 ans = -1;
             }
-
-            // Check for the last index.
-            if (ans != -1 && arr1[arr1.length - 2] >= arr1[arr1.length - 1]) {
-                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;
+        }
+        // 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]) {