1460. Make Two Arrays Equal by Reversing Subarrays LeetCode Solution

In this guide, you will get 1460. Make Two Arrays Equal by Reversing Subarrays LeetCode Solution with the best time and space complexity. The solution to Make Two Arrays Equal by Reversing Subarrays problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.

Table of Contents

  1. Problem Statement
  2. Complexity Analysis
  3. Make Two Arrays Equal by Reversing Subarrays solution in C++
  4. Make Two Arrays Equal by Reversing Subarrays solution in Java
  5. Make Two Arrays Equal by Reversing Subarrays solution in Python
  6. Additional Resources
1460. Make Two Arrays Equal by Reversing Subarrays LeetCode Solution image

Problem Statement of 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.

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.

See also  2349. Design a Number Container System LeetCode Solution

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

Complexity Analysis

  • Time Complexity: O(n)
  • Space Complexity: O(n)

1460. Make Two Arrays Equal by Reversing Subarrays LeetCode Solution in C++

class Solution {
 public:
  bool canBeEqual(vector<int>& target, vector<int>& arr) {
    return unordered_multiset<int>(arr.begin(), arr.end()) ==
           unordered_multiset<int>(target.begin(), target.end());
  }
};
/* code provided by PROGIEZ */

1460. Make Two Arrays Equal by Reversing Subarrays LeetCode Solution in Java

class Solution {
  public boolean canBeEqual(int[] target, int[] arr) {
    return Arrays.stream(arr)
        .boxed()
        .collect(Collectors.groupingBy(Integer::intValue, Collectors.counting()))
        .equals(Arrays.stream(target).boxed().collect(
            Collectors.groupingBy(Integer::intValue, Collectors.counting())));
  }
}
// code provided by PROGIEZ

1460. Make Two Arrays Equal by Reversing Subarrays LeetCode Solution in Python

class Solution:
  def canBeEqual(self, target: list[int], arr: list[int]) -> bool:
    return collections.Counter(arr) == collections.Counter(target)
 # code by PROGIEZ

Additional Resources

Happy Coding! Keep following PROGIEZ for more updates and solutions.

Similar: