Skip to content
Related Articles

Related Articles

Check if two arrays can be made equal by reversing subarrays multiple times
  • Last Updated : 22 Apr, 2021

Given two arrays A[] and B[], the task is to check if array B can be made equal to A by reversing the subarrays of B by any number of times.

Examples: 

Input:  A[] =  {1 2 3}, B[] =  {3 1 2}
Output: Yes
Explanation: 
Reverse subarrays in array B as shown below:
Reverse subarray [3, 1], B becomes [1, 3, 2]
Reverse subarray [3, 2], B becomes [1, 2, 3] = A
There are multiple ways to convert B to A.
Input:  A[] = {1 2 3}, B[] = {3 4 1 }
Output: No
 

Approach: Since we have to make array B equal to array A only by reversing any sub array any number of times, Therefore it is possible only when both the arrays are anagrams. To check if both arrays are anagrams, we will sort both the arrays and check if at any index elements are not same then we will return false, otherwise we will return true at the end.

Below implementation of the above approach:

C++




// C++ implementation to check if
// two arrays can be made equal
 
#include <bits/stdc++.h>
using namespace std;
 
// Function to check if array B
// can be made equal to array A
bool canMadeEqual(int A[],
                  int B[], int n)
{
    // sort both the arrays
    sort(A, A + n);
    sort(B, B + n);
 
    // Check if both the arrays
    // are equal or not
    for (int i = 0; i < n; i++)
        if (A[i] != B[i])
            return false;
    return true;
}
 
// Driver Code
int main()
{
    int A[] = { 1, 2, 3 };
    int B[] = { 1, 3, 2 };
    int n = sizeof(A) / sizeof(A[0]);
    if (canMadeEqual(A, B, n))
        cout << "Yes";
    else
        cout << "No";
 
    return 0;
}
C



// C implementation to check if 
// two arrays can be made equal
#include<stdio.h>
#include<math.h>
 
int sort(int a[],int n)
{
    int i, j, tmp;
    for(i = 0; i < n; i++)
    {
        for(j = i + 1; j < n; j++)
        {
            if(a[j] <a[i])
            {
                tmp = a[i];
                a[i] = a[j];
                a[j] = tmp;
            }
        }
    }
    return 0;
}
 
// Function to check if array B
// can be made equal to array A
int canMadeEqual(int A[], int B[], int n)
{
    int i;
     
    // Sort both arrays
    sort(A, n);
    sort(B, n);
     
    // Check both arrays equal or not
    for(i = 0; i < n; i++)
    {
        if (A[i] != B[i])
        {
            return(0);
        }
    }
    return (1);
}
 
// Driver Code
int main()
{
    int A[] = { 1, 2, 3 };
    int n;
    int B[] = { 1, 3, 2 };
     
    n = sizeof(A) / sizeof(A[0]);
    if(canMadeEqual(A, B, n))
    {
        printf("Yes");
    }
    else
    {
        printf("No");
    }
    return 0;
}
 
// This code is contributed by adityakumar27200
Java



// Java implementation to check if
// two arrays can be made equal
import java.util.*;
 
class GFG{
     
// Function to check if array B
// can be made equal to array A
public static boolean canMadeEqual(int[] A,
                                   int[] B,
                                   int n)
{
     
    // Sort both the arrays
    Arrays.sort(A);
    Arrays.sort(B);
 
    // Check if both the arrays
    // are equal or not
    for(int i = 0; i < n; i++)
    {
        if (A[i] != B[i])
        {
            return false;
        }
    }
    return true;
}
 
// Driver code
public static void main(String[] args)
{
    int A[] = { 1, 2, 3 };
    int B[] = { 1, 3, 2 };
    int n = A.length;
     
    if (canMadeEqual(A, B, n))
        System.out.print("Yes");
    else
        System.out.print("No");
}
}
 
// This code is contributed by divyeshrabadiya07
Python3



# Python3 implementation to check if
# two arrays can be made equal
 
# Function to check if array B
# can be made equal to array A
def canMadeEqual(A, B, n):
   
  # Sort both the arrays
  A.sort()
  B.sort()
 
  # Check if both the arrays
  # are equal or not
  for i in range(n):
    if (A[i] != B[i]):
      return False
     
  return True
 
# Driver Code
if __name__ == "__main__":
   
  A = [ 1, 2, 3 ]
  B = [ 1, 3, 2 ]
  n = len(A)
 
  if (canMadeEqual(A, B, n)):
    print( "Yes")
  else:
    print("No")
 
# This code is contributed by chitranayal
C#



// C# implementation to check if
// two arrays can be made equal
using System;
 
class GFG{
 
// Function to check if array B
// can be made equal to array A
static bool canMadeEqual(int[] A,
                         int[] B,
                         int n)
{
     
    // Sort both the arrays
    Array.Sort(A);
    Array.Sort(B);
 
    // Check if both the arrays
    // are equal or not
    for(int i = 0; i < n; i++)
    {
        if (A[i] != B[i])
        {
            return false;
        }
    }
    return true;
}
 
// Driver code
public static void Main()
{
    int[] A = { 1, 2, 3 };
    int[] B = { 1, 3, 2 };
    int n = A.Length;
     
    if (canMadeEqual(A, B, n))
        Console.Write("Yes");
    else
        Console.Write("No");
}
}
 
// This code is contributed by adityakumar27200
Javascript



<script>
 
 
// Javascript implementation to check if
// two arrays can be made equal
 
// Function to check if array B
// can be made equal to array A
function canMadeEqual(A, B, n)
{
    // sort both the arrays
    A.sort();
    B.sort();
 
    // Check if both the arrays
    // are equal or not
    for (var i = 0; i < n; i++)
        if (A[i] != B[i])
            return false;
    return true;
}
 
// Driver Code
var A = [ 1, 2, 3 ];
var B = [ 1, 3, 2 ];
var n = A.length;
if (canMadeEqual(A, B, n))
    document.write( "Yes");
else
    document.write("No");
 
// This code is contributed by rutvik_56.
</script>
Output
Yes
Time complexity: O(N*Log N) 
Auxiliary Space: O(1)



My Personal Notes
arrow_drop_up
Previous
Check if two arrays can be made equal by reversing any subarray once
Next

Merge Sort
Recommended Articles
Page :
Check if two arrays can be made equal by reversing any subarray once
09, Jul 20
Check whether two strings can be made equal by reversing substring of equal length from both strings
15, Jul 20
Check if two strings can be made equal by reversing a substring of one of the strings
09, Dec 20
Count N-length arrays made from first M natural numbers whose subarrays can be made palindromic by replacing less than half of its elements
16, Dec 20
Check if two arrays can be made equal by swapping pairs of one of the arrays
03, Feb 21
Number of times an array can be partitioned repetitively into two subarrays with equal sum
26, Jun 20
Check if given array can be made 0 with given operations performed any number of times
25, Mar 20
Queries to check whether all the elements can be made positive by flipping signs exactly K times
29, May 19
Number of ways to select equal sized subarrays from two arrays having atleast K equal pairs of elements
06, May 20
String obtained by reversing and complementing a Binary string K times
09, Apr 20
Lexicographically largest permutation of array possible by reversing suffix subarrays
12, Feb 21
Check whether the string S1 can be made equal to S2 with the given operation
13, Nov 19
Check if a string can be made equal to another string by swapping or replacement of characters
24, Jan 21
Check if sum of array can be made equal to X by removing either the first or last digits of every array element
23, Mar 21
Check if all elements of a Circular Array can be made equal by increments of adjacent pairs
18, Aug 20
Check if all the elements can be made equal on dividing with X and Y
11, Jul 19
Check if given strings can be made same by swapping two characters of same or different strings
07, Dec 20
Check if an Array is made up of Subarrays of continuous repetitions of every distinct element
05, Aug 20
Minimum flips of odd indexed elements from odd length subarrays to make two given arrays equal
02, Dec 20
Maximize sum of product of same-indexed elements of equal length subarrays obtained from two given arrays
30, Apr 21
Count all N-length arrays made up of distinct consecutive elements whose first and last elements are equal
06, Jan 21
Find if array can be divided into two subarrays of equal sum
04, Aug 16
Check if an array can be split into K non-overlapping subarrays whose Bitwise AND values are equal
13, Jan 21
Longest subarray whose elements can be made equal by maximum K increments
13, Jun 20
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
spp____
@spp____
Vote for difficulty





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox