You are given two integer arrays of equal length, target and arr. In one operation, you may select any non empty subarray of arr and reverse it in place. You are permitted to perform this operation any number of times.

Return true if arr can be made identical to target, or false otherwise.

Constraints:

• target.length $=$ arr.length

• $1 \leq$ target.length $\leq 1000$

• $1 \leq$ target[i] $\leq 1000$

• $1 \leq$ arr[i] $\leq 1000$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.