Rearrange an array such that product of every two consecutive elements is a multiple of 4
Given an array arr[] of size N, the task is to rearrange the array elements such that for every index i(1 <= i <= N – 1), the product of arr[i] and arr[i – 1] is a multiple of 4.
Example:
Input: arr[] = {1, 10, 100}
Output: 1, 100, 10
Explanation:
1 * 100 is divisible by 4
100 * 10 is divisible by 4
Input: arr[] = {2, 7, 1, 8, 2, 8}
Output: 7, 8, 1, 8, 2, 2
Naive Approach:
The simplest approach to solve the problem is to generate all possible permutations of the array and for every permutation, check if the product of every two consecutive elements is a multiple of 4 or not.
Time complexity: O(N^2 * N!)
Auxiliary Space: O(N!)
Efficient Approach:
Follow the steps below to optimize the above approach:
- Initialize following three variables:
- odd = Number of odd elements.
- four = Number of elements divisible by 4.
- non_four = Number of even elements not divisible by 4.
- Consider the following two cases:
- Case 1: non_four = 0
In this case, no even elements are present which are not divisible by 4.
- The optimal way is to first place the “odd” elements first in the array in alternate positions.
- Fill the vacancies with the even elements.
Illustration
arr[] = {1, 1, 1, 4, 4}
Step 0: four = 2, odd = 3
Step 1: {1 _ 1 _ 1}
Step 2: {1 4 1 4 1}
- Hence, for the approach to be mathematically possible, the difference between the count of even and odd elements should not exceed 1.
- Case 2: non_four > 0
In this case, even elements that are not divisible by 4 exist in the array.
- Follow the exact same strategy as depicted above by placing the elements divisible by 4 in alternate positions followed by odd elements in the vacancies.
- Then, place all the remaining even elements at the end of the array. This is because the product of two even numbers is always divisible by 4. Hence, placing the even elements towards the end of the array guarantees that the product of consecutive elements among them is divisible by 4.
Illustration:
arr[] = {2, 7, 1, 8, 2, 8}
Step 1: four = 2, non_four = 2, odd = 2
Step 2: {_ 8 _ 8}
Step 3: {1 8 7 8}
Step 4: {1 8 7 8 2 2}
- For this to be possible mathematically, four >= odd.
Below is the implementation of the above approach:
C++
#include <bits/stdc++.h>
using namespace std;
void Permute(vector< int >& arr,
int n)
{
int odd = 0, four = 0;
int non_four = 0;
vector< int > ODD, FOUR,
NON_FOUR;
for ( auto x : arr) {
if (x & 1) {
odd++;
ODD.push_back(x);
}
else if (x % 4 == 0) {
four++;
FOUR.push_back(x);
}
else {
non_four++;
NON_FOUR.push_back(x);
}
}
if (non_four == 0
&& four >= odd - 1) {
int x = ODD.size();
int y = FOUR.size();
int i;
for (i = 0; i < x; i++) {
cout << ODD[i] << " " ;
if (i < y)
cout << FOUR[i] << " " ;
}
while (i < y)
cout << FOUR[i] << " " ;
cout << endl;
}
else if (non_four > 0
and four >= odd) {
int x = ODD.size();
int y = FOUR.size();
int i;
for (i = 0; i < x; i++) {
cout << ODD[i] << " " ;
if (i < y)
cout << FOUR[i] << " " ;
}
while (i < y)
cout << FOUR[i] << " " ;
for ( int j = 0;
j < ( int )NON_FOUR.size();
j++)
cout << NON_FOUR[j] << " " ;
cout << endl;
}
else
cout << "Not Possible" << endl;
}
signed main()
{
vector< int > arr = { 2, 7, 1,
8, 2, 8 };
int N = sizeof (arr) / sizeof (arr);
Permute(arr, N);
return 0;
}
|
Java
import java.io.*;
import java.util.*;
class GFG{
public static void Permute(Vector<Integer> arr, int n)
{
int odd = 0 , four = 0 ;
int non_four = 0 ;
Vector<Integer> ODD = new Vector<Integer>();
Vector<Integer> FOUR = new Vector<Integer>(n);
Vector<Integer> NON_FOUR = new Vector<Integer>(n);
for ( int x : arr)
{
if (x % 2 != 0 )
{
odd++;
ODD.add(x);
}
else if (x % 4 == 0 )
{
four++;
FOUR.add(x);
}
else
{
non_four++;
NON_FOUR.add(x);
}
}
if (non_four == 0 && four >= odd - 1 )
{
int x = ODD.size();
int y = FOUR.size();
int i;
for (i = 0 ; i < x; i++)
{
System.out.print(ODD.get(i) + " " );
if (i < y)
System.out.print(FOUR.get(i) + " " );
}
while (i < y)
System.out.print(FOUR.get(i) + " " );
System.out.println();
}
else if (non_four > 0 && four >= odd)
{
int x = ODD.size();
int y = FOUR.size();
int i;
for (i = 0 ; i < x; i++)
{
System.out.print(ODD.get(i) + " " );
if (i < y)
System.out.print(FOUR.get(i) + " " );
}
while (i < y)
System.out.print(FOUR.get(i) + " " );
for ( int j = 0 ; j < ( int )NON_FOUR.size(); j++)
System.out.print(NON_FOUR.get(j) + " " );
System.out.println();
}
else
System.out.println( "Not Possible" );
}
public static void main(String[] args)
{
Vector<Integer> arr = new Vector<Integer>();
arr.add( 2 );
arr.add( 7 );
arr.add( 1 );
arr.add( 8 );
arr.add( 2 );
arr.add( 8 );
Permute(arr, arr.size());
}
}
|
Python3
def Permute(arr, n):
odd = 0
four = 0
non_four = 0
ODD, FOUR, NON_FOUR = [], [], []
for x in arr:
if (x & 1 ):
odd + = 1
ODD.append(x)
elif (x % 4 = = 0 ):
four + = 1
FOUR.append(x)
else :
non_four + = 1
NON_FOUR.append(x)
if (non_four = = 0 and four > = odd - 1 ):
x = len (ODD)
y = len (FOUR)
i = 0
while i < x:
print (ODD[i], end = " " )
if (i < y):
print (FOUR[i], end = " " )
while (i < y):
print (FOUR[i], end = " " )
i + = 1
print ()
elif (non_four > 0 and four > = odd):
x = len (ODD)
y = len (FOUR)
i = 0
while i < x:
print (ODD[i], end = " " )
if (i < y):
print (FOUR[i], end = " " )
i + = 1
while (i < y):
print (FOUR[i], end = " " )
i + = 1
for j in NON_FOUR:
print (j, end = " " )
else :
print ( "Not Possible" )
if __name__ = = '__main__' :
arr = [ 2 , 7 , 1 , 8 , 2 , 8 ]
N = len (arr)
Permute(arr, N)
|
C#
using System;
using System.Collections.Generic;
class GFG{
public static void Permute(List< int > arr,
int n)
{
int odd = 0, four = 0;
int non_four = 0;
List< int > ODD =
new List< int >();
List< int > FOUR =
new List< int >(n);
List< int > NON_FOUR =
new List< int >(n);
foreach ( int x in arr)
{
if (x % 2 != 0)
{
odd++;
ODD.Add(x);
}
else if (x % 4 == 0)
{
four++;
FOUR.Add(x);
}
else
{
non_four++;
NON_FOUR.Add(x);
}
}
if (non_four == 0 &&
four >= odd - 1)
{
int x = ODD.Count;
int y = FOUR.Count;
int i;
for (i = 0; i < x; i++)
{
Console.Write(ODD[i] + " " );
if (i < y)
Console.Write(FOUR[i] + " " );
}
while (i < y)
Console.Write(FOUR[i] + " " );
Console.WriteLine();
}
else if (non_four > 0 &&
four >= odd)
{
int x = ODD.Count;
int y = FOUR.Count;
int i;
for (i = 0; i < x; i++)
{
Console.Write(ODD[i] + " " );
if (i < y)
Console.Write(FOUR[i] + " " );
}
while (i < y)
Console.Write(FOUR[i] + " " );
for ( int j = 0;
j < ( int )NON_FOUR.Count; j++)
Console.Write(NON_FOUR[j] + " " );
Console.WriteLine();
}
else
Console.WriteLine( "Not Possible" );
}
public static void Main(String[] args)
{
List< int > arr = new List< int >();
arr.Add(2);
arr.Add(7);
arr.Add(1);
arr.Add(8);
arr.Add(2);
arr.Add(8);
Permute(arr, arr.Count);
}
}
|
Javascript
<script>
function Permute(arr,n)
{
let odd = 0, four = 0;
let non_four = 0;
let ODD = [];
let FOUR = [];
let NON_FOUR = [];
for (let x = 0; x < arr.length; x++)
{
if (arr[x] % 2 != 0)
{
odd++;
ODD.push(arr[x]);
}
else if (arr[x] % 4 == 0)
{
four++;
FOUR.push(arr[x]);
}
else
{
non_four++;
NON_FOUR.push(arr[x]);
}
}
if (non_four == 0 && four >= odd - 1)
{
let x = ODD.length;
let y = FOUR.length;
let i;
for (i = 0; i < x; i++)
{
document.write(ODD[i] + " " );
if (i < y)
document.write(FOUR[i] + " " );
}
while (i < y)
document.write(FOUR[i] + " " );
document.write( "<br>" );
}
else if (non_four > 0 && four >= odd)
{
let x = ODD.length;
let y = FOUR.length;
let i;
for (i = 0; i < x; i++)
{
document.write(ODD[i] + " " );
if (i < y)
document.write(FOUR[i] + " " );
}
while (i < y)
document.write(FOUR[i] + " " );
for (let j = 0; j < NON_FOUR.length; j++)
document.write(NON_FOUR[j] + " " );
document.write( "<br>" );
}
else
document.write( "Not Possible<br>" );
}
let arr=[2,7,1,8,2,8]
Permute(arr, arr.length);
</script>
|
Output:
7 8 1 8 2 2
Time Complexity: O(N)
Auxiliary Space: O(1)
Last Updated :
08 Jul, 2021
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...