Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Check if two arrays are permutations of each other using Mathematical Operation

  • Last Updated : 11 Aug, 2021

Given two unsorted arrays of same size where arr[i] >= 0 for all i, the task is to check if two arrays are permutations of each other or not.
Examples: 
 

Input: arr1[] = {2, 1, 3, 5, 4, 3, 2}
       arr2[] = {3, 2, 2, 4, 5, 3, 1}
Output: Yes

Input: arr1[] = {2, 1, 3, 5}
       arr2[] = {3, 2, 2, 4}
Output: No

 

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.

In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students.

It has been already discussed in Check if two arrays are permutations of each other using Sorting and Hashing. But in this post, a different approach is discussed.
 



Approach:  

  1. Traverse the first array A, add and multiply all the elements and store them in variables as Sum1 and Mul1 respectively.
  2. Similarly, traverse the second array B, add and multiply all the elements and store them in variables as Sum2 and Mul2 respectively.
  3. Now, compare both sum1, sum2 and mul1, mul2. If Sum1 == Sum2 and Mul1 == Mul2, then both arrays are permutations of each other, else not.

Below is the implementation of above approach: 
 

C++




// CPP code to check if arrays
// are permutations of eah other
#include <iostream>
using namespace std;
 
// Function to check if arrays
// are permutations of each other.
bool arePermutations(int a[], int b[], int n, int m)
{
 
    int sum1 = 0, sum2 = 0, mul1 = 1, mul2 = 1;
 
    // Calculating sum and multiply of first array
    for (int i = 0; i < n; i++) {
        sum1 += a[i];
        mul1 *= a[i];
    }
 
    // Calculating sum and multiply of second array
    for (int i = 0; i < m; i++) {
        sum2 += b[i];
        mul2 *= b[i];
    }
 
    // If sum and mul of both arrays are equal,
    // return true, else return false.
    return ((sum1 == sum2) && (mul1 == mul2));
}
 
// Driver code
int main()
{
 
    int a[] = { 1, 3, 2 };
    int b[] = { 3, 1, 2 };
 
    int n = sizeof(a) / sizeof(int);
    int m = sizeof(b) / sizeof(int);
 
    if (arePermutations(a, b, n, m))
        cout << "Yes" << endl;
     
    else
        cout << "No" << endl;
 
    return 0;
}
Java



// Java code to check if arrays
// are permutations of eah other
 
import java.io.*;
 
class GFG {
 
 
// Function to check if arrays
// are permutations of each other.
static boolean arePermutations(int a[], int b[], int n, int m)
{
 
    int sum1 = 0, sum2 = 0, mul1 = 1, mul2 = 1;
 
    // Calculating sum and multiply of first array
    for (int i = 0; i < n; i++) {
        sum1 += a[i];
        mul1 *= a[i];
    }
 
    // Calculating sum and multiply of second array
    for (int i = 0; i < m; i++) {
        sum2 += b[i];
        mul2 *= b[i];
    }
 
    // If sum and mul of both arrays are equal,
    // return true, else return false.
    return ((sum1 == sum2) && (mul1 == mul2));
}
 
// Driver code
 
    public static void main (String[] args) {
            int a[] = { 1, 3, 2 };
    int b[] = { 3, 1, 2 };
 
    int n = a.length;
    int m = b.length;
 
    if (arePermutations(a, b, n, m)==true)
        System.out.println( "Yes");
     
    else
        System.out.println( "No");
    }
}
// This code is contributed by  inder_verma..
Python3



# Python 3 program to check if arrays
# are permutations of eah other
 
# Function to check if arrays
# are permutations of each other
def arePermutations(a, b, n, m) :
 
    sum1, sum2, mul1, mul2 = 0, 0, 1, 1
 
    # Calculating sum and multiply of first array
    for i in range(n) :
        sum1 += a[i]
        mul1 *= a[i]
 
    # Calculating sum and multiply of second array
    for i in range(m) :
        sum2 += b[i]
        mul2 *= b[i]
 
    # If sum and mul of both arrays are equal,
    # return true, else return false.
    return((sum1 == sum2) and (mul1 == mul2))
 
 
# Driver code    
if __name__ == "__main__" :
 
    a = [ 1, 3, 2]
    b = [ 3, 1, 2]
 
    n = len(a)
    m = len(b)
 
    if arePermutations(a, b, n, m) :
        print("Yes")
 
    else :
        print("No")
 
  
# This code is contributed by ANKITRAI1
C#



// C# code to check if arrays
// are permutations of eah other
using System;
 
class GFG
{
 
// Function to check if arrays
// are permutations of each other.
static bool arePermutations(int[] a, int[] b,
                            int n, int m)
{
 
    int sum1 = 0, sum2 = 0,
        mul1 = 1, mul2 = 1;
 
    // Calculating sum and multiply
    // of first array
    for (int i = 0; i < n; i++)
    {
        sum1 += a[i];
        mul1 *= a[i];
    }
 
    // Calculating sum and multiply
    // of second array
    for (int i = 0; i < m; i++)
    {
        sum2 += b[i];
        mul2 *= b[i];
    }
 
    // If sum and mul of both arrays
    // are equal, return true, else
    // return false.
    return ((sum1 == sum2) &&
            (mul1 == mul2));
}
 
// Driver code
public static void Main ()
{
    int[] a = { 1, 3, 2 };
    int[] b = { 3, 1, 2 };
     
    int n = a.Length;
    int m = b.Length;
     
    if (arePermutations(a, b, n, m) == true)
        Console.Write( "Yes");
     
    else
        Console.Write( "No");
}
}
 
// This code is contributed
// by ChitraNayal
PHP



<?php
// PHP code to check if arrays
// are permutations of eah other
 
// Function to check if arrays
// are permutations of each other.
function arePermutations($a, $b, $n, $m)
{
 
    $sum1 = 0; $sum2 = 0;
    $mul1 = 1; $mul2 = 1;
 
    // Calculating sum and multiply
    // of first array
    for ($i = 0; $i < $n; $i++)
    {
        $sum1 += $a[$i];
        $mul1 *= $a[$i];
    }
 
    // Calculating sum and multiply
    // of second array
    for ($i = 0; $i < $m; $i++)
    {
        $sum2 += $b[$i];
        $mul2 *= $b[$i];
    }
 
    // If sum and mul of both arrays
    // are equal, return true, else
    // return false.
    return (($sum1 == $sum2) &&
            ($mul1 == $mul2));
}
 
// Driver code
$a = array( 1, 3, 2 );
$b = array( 3, 1, 2 );
 
$n = sizeof($a);
$m = sizeof($b);
 
if (arePermutations($a, $b, $n, $m))
    echo "Yes" . "\n";
else
    echo "No" . "\n";
 
// This code is contributed
// by Akanksha Rai(Abby_akku)
Javascript



<script>
 
// JavaScript code to check if arrays
// are permutations of eah other
     
    // Function to check if arrays
   // are permutations of each other.
    function arePermutations(a,b,n,m)
    {
        let sum1 = 0, sum2 = 0, mul1 = 1, mul2 = 1;
   
    // Calculating sum and multiply of first array
    for (let i = 0; i < n; i++) {
        sum1 += a[i];
        mul1 *= a[i];
    }
   
    // Calculating sum and multiply of second array
    for (let i = 0; i < m; i++) {
        sum2 += b[i];
        mul2 *= b[i];
    }
   
    // If sum and mul of both arrays are equal,
    // return true, else return false.
    return ((sum1 == sum2) && (mul1 == mul2));
     
    }
     
    // Driver code
    let a=[1, 3, 2 ];
    let b=[3, 1, 2];
     
    let n = a.length;
    let m = b.length;
     
    if (arePermutations(a, b, n, m)==true)
        document.write( "Yes");
       
    else
        document.write( "No");
     
 
// This code is contributed by rag2127
 
</script>
Output: 
Yes
 



My Personal Notes
arrow_drop_up
Next

Check if two arrays are permutations of each other
Recommended Articles
Page :
Check if two arrays are permutations of each other
01, Jul 15
Check if two Linked Lists are permutations of each other
16, Oct 18
Minimize count of given operations required to make two given strings permutations of each other
23, Sep 20
Check if given string can be formed by two other strings or their permutations
26, Jun 19
Count number of common elements between two arrays by using Bitset and Bitwise operation
19, Jun 19
Check if two Integer are anagrams of each other
30, Sep 19
C Program to check if two given strings are isomorphic to each other
13, Oct 20
Check if two given circles touch or intersect each other
11, Sep 17
Minimize the sum of product of two arrays with permutations allowed
23, Dec 16
Count pairs from two arrays whose modulo operation yields K
22, Nov 18
Check if X can be converted to Y by converting to 3 * (X / 2) or X - 1 in each operation
16, Mar 21
Parity of the given mathematical expression using given N numbers
09, Jun 20
Arrange given numbers in a mathematical expression using operators [+, -, *, /] and parentheses to get value 24
03, Aug 21
Tau - A Mathematical Constant
22, Oct 17
Minimize sum of product of same-indexed elements of two arrays by reversing a subarray of one of the two arrays
31, May 21
Check if a Sequence is a concatenation of two permutations
04, Apr 20
Check if two arrays can be made equal by swapping pairs of one of the arrays
03, Feb 21
Count ways to split a string into two subsets that are reverse of each other
29, Jun 21
Check if a given array contains duplicate elements within k distance from each other
29, Dec 14
Check if every pair of 1 in the array is at least K length apart from each other
05, May 20
Check if roots of a Quadratic Equation are reciprocal of each other or not
10, Jun 20
Check if all the pairs of an array are coprime with each other
12, Sep 20
Count of permutations of an Array having each element as a multiple or a factor of its index
21, Aug 20
Count of permutations of an Array having maximum MEXs sum of prefix arrays
11, Oct 21
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
barykrg
@barykrg
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

Start Your Coding Journey Now!