# 1460. Make Two Arrays Equal by Reversing Subarrays

## Description

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.

Example 1:

Input: target = [1,2,3,4], arr = [2,4,1,3]
Output: true
Explanation: You can follow the next steps to convert arr to target:
1- Reverse subarray [2,4,1], arr becomes [1,4,2,3]
2- Reverse subarray [4,2], arr becomes [1,2,4,3]
3- Reverse subarray [4,3], arr becomes [1,2,3,4]
There are multiple ways to convert arr to target, this is not the only way to do so.


Example 2:

Input: target = [7], arr = [7]
Output: true
Explanation: arr is equal to target without any reverses.


Example 3:

Input: target = [3,7,9], arr = [3,7,11]
Output: false
Explanation: arr does not have value 9 and it can never be converted to target.


Constraints:

• target.length == arr.length
• 1 <= target.length <= 1000
• 1 <= target[i] <= 1000
• 1 <= arr[i] <= 1000

## Solutions

• class Solution {
public boolean canBeEqual(int[] target, int[] arr) {
Arrays.sort(target);
Arrays.sort(arr);
return Arrays.equals(target, arr);
}
}

• class Solution {
public:
bool canBeEqual(vector<int>& target, vector<int>& arr) {
sort(target.begin(), target.end());
sort(arr.begin(), arr.end());
return target == arr;
}
};

• class Solution:
def canBeEqual(self, target: List[int], arr: List[int]) -> bool:
target.sort()
arr.sort()
return target == arr


• func canBeEqual(target []int, arr []int) bool {
sort.Ints(target)
sort.Ints(arr)
for i, v := range target {
if v != arr[i] {
return false
}
}
return true
}

• function canBeEqual(target: number[], arr: number[]): boolean {
target.sort((a, b) => a - b);
arr.sort((a, b) => a - b);
const n = arr.length;
for (let i = 0; i < n; i++) {
if (target[i] !== arr[i]) {
return false;
}
}
return true;
}


• class Solution {
/**
* @param Integer[] $target * @param Integer[]$arr
* @return Boolean
*/
function canBeEqual($target,$arr) {
sort($target); sort($arr);
return $target ===$arr;
}
}


• impl Solution {
pub fn can_be_equal(mut target: Vec<i32>, mut arr: Vec<i32>) -> bool {
target.sort();
arr.sort();
target == arr
}
}