Make Two Arrays Equal by Reversing Subarrays

You are given two integer arrays of equal length target and arr. In one step, you can select any non-empty subarray of arr and reverse it. You are allowed to make any number of steps.

Return true if you can make arr equal to target or false otherwise.

LeetCode Problem - 1460: Link | Click Here

class Solution{
    // Method to check if two arrays can be made equal
    public boolean canBeEqual(int[] target, int[] arr) {
        // Temporary array to store matching elements
        int[] resultArr = new int[arr.length];

        // Loop through each element in the target array
        for (int i=0; i<target.length; i++){
            // Loop through each element in the input array
            for (int j=0; j<arr.length; j++){
                // Check if the current element in target matches any element in arr
                if (target[i]==arr[j]){
                    // Store the matching element in the resultArr
                    resultArr[i] = target[i];
                    // Mark the matched element in arr with a placeholder value (-1)
                    arr[j] = -1;
                    // Break out of the inner loop as the match is found
                    break;
                }
            }

            // Check if the current element in resultArr is not equal to the original element in target
            if (resultArr[i]!=target[i]){
                // If not equal, arrays cannot be made equal, return false
                return false;
            }
        }

        // If all elements are successfully matched and verified, return true
        return true;
    }
}