Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Minimum operations required to modify the array such that parity of adjacent elements is different

  • Last Updated : 25 Aug, 2021

Given an array A[], the task is to find the minimum number of operations required to convert the array into B[] such that for every index in B (except the last) parity(b[i]) != parity(b[i + 1]) where parity(x) = x % 3. 

Below is the operation to be performed: 

Attention reader! Don’t stop learning now. Get hold of all the important mathematical concepts for competitive programming with the Essential Maths for CP Course at a student-friendly price. To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.

Any element from the set {1, 2} can be added to any element of the array.

Examples: 
 



Input: A[] = {2, 1, 3, 0} 
Output: 1 
1 can be added to 0 in a single operation and the array becomes {2, 1, 3, 1}.
Input: A[] = {2, 2, 2, 2} 
Output: 2 

Approach: An optimal approach is to update the element which is in between two other elements so that it can be updated such that its parity can be different from the element previous to it and the element next to it in a single operation (as the number of operations needs to be minimized). 
So, start traversing the array from A[1] to A[n – 2] and for every element A[i] such that parity(A[i]) == parity(A[i – 1]) or parity(A[i]) == parity(A[i + 1]), update A[i] such that its parity is different from both the numbers surrounding it and keep a track of the count of operations performed. Print the count in the end.

Below is the implementation of the above approach:
 

C++




// C++ implementation of the approach
#include <bits/stdc++.h>
using namespace std;
 
// Function to return the parity of a number
int parity(int a)
{
    return a % 3;
}
 
// Function to return the minimum
// number of operations required
int solve(int array[], int size)
{
    int operations = 0;
    for (int i = 0; i < size - 1; i++) {
 
        // Operation needs to be performed
        if (parity(array[i]) == parity(array[i + 1])) {
 
            operations++;
            if (i + 2 < size) {
 
                // Parity of previous element
                int pari1 = parity(array[i]);
 
                // Parity of next element
                int pari2 = parity(array[i + 2]);
 
                // Update parity of current element to be other than
                // the parities of the previous and the next number
                if (pari1 == pari2) {
                    if (pari1 == 0)
                        array[i + 1] = 1;
                    else if (pari1 == 1)
                        array[i + 1] = 0;
                    else
                        array[i + 1] = 1;
                }
                else {
                    if ((pari1 == 0 && pari2 == 1)
                        || (pari1 == 1 && pari2 == 0))
                        array[i + 1] = 2;
                    if ((pari1 == 1 && pari2 == 2)
                        || (pari1 == 2 && pari2 == 1))
                        array[i + 1] = 0;
                    if ((pari1 == 2 && pari2 == 0)
                        || (pari1 == 0 && pari2 == 2))
                        array[i + 1] = 1;
                }
            }
        }
    }
 
    return operations;
}
 
// Driver Code
int main()
{
    int array[] = { 2, 1, 3, 0 };
    int size = sizeof(array) / sizeof(array[0]);
    cout << solve(array, size) << endl;
 
  return 0;
}
Java



// Java implementation of the approach
class GFG
{
     
    // Function to return the parity of a number
    static int parity(int a)
    {
        return a % 3;
    }
 
    // Function to return the minimum
    // number of operations required
    static int solve(int []array, int size)
    {
        int operations = 0;
        for (int i = 0; i < size - 1; i++)
        {
     
            // Operation needs to be performed
            if (parity(array[i]) == parity(array[i + 1]))
            {
     
                operations++;
                if (i + 2 < size)
                {
     
                    // Parity of previous element
                    int pari1 = parity(array[i]);
     
                    // Parity of next element
                    int pari2 = parity(array[i + 2]);
     
                    // Update parity of current
                    // element to be other than
                    // the parities of the previous
                    // and the next number
                    if (pari1 == pari2)
                    {
                        if (pari1 == 0)
                            array[i + 1] = 1;
                        else if (pari1 == 1)
                            array[i + 1] = 0;
                        else
                            array[i + 1] = 1;
                    }
                    else
                    {
                        if ((pari1 == 0 && pari2 == 1) ||
                            (pari1 == 1 && pari2 == 0))
                            array[i + 1] = 2;
                        if ((pari1 == 1 && pari2 == 2)
                            || (pari1 == 2 && pari2 == 1))
                            array[i + 1] = 0;
                        if ((pari1 == 2 && pari2 == 0)
                            || (pari1 == 0 && pari2 == 2))
                            array[i + 1] = 1;
                    }
                }
            }
        }
     
        return operations;
    }
 
    // Driver Code
    public static void main (String arg[])
    {
        int []array = { 2, 1, 3, 0 };
        int size = array.length;
        System.out.println(solve(array, size));
    }
}
 
// This code is contributed by Ryuga
Python3



# Python3 implementation of the approach
 
# Function to return the parity
# of a number
def parity(a):
    return a % 3
 
# Function to return the minimum
# number of operations required
def solve(array, size):
 
    operations = 0
    for i in range(0, size - 1):
 
        # Operation needs to be performed
        if parity(array[i]) == parity(array[i + 1]):
 
            operations += 1
            if i + 2 < size:
 
                # Parity of previous element
                pari1 = parity(array[i])
 
                # Parity of next element
                pari2 = parity(array[i + 2])
 
                # Update parity of current element to
                # be other than the parities of the
                # previous and the next number
                if pari1 == pari2:
                    if pari1 == 0:
                        array[i + 1] = 1
                    elif pari1 == 1:
                        array[i + 1] = 0
                    else:
                        array[i + 1] = 1
                 
                else:
                    if ((pari1 == 0 and pari2 == 1) or
                        (pari1 == 1 and pari2 == 0)):
                        array[i + 1] = 2
                    if ((pari1 == 1 and pari2 == 2) or
                        (pari1 == 2 and pari2 == 1)):
                        array[i + 1] = 0
                    if ((pari1 == 2 and pari2 == 0) and
                        (pari1 == 0 and pari2 == 2)):
                        array[i + 1] = 1
 
    return operations
 
# Driver Code
if __name__ == "__main__":
 
    array = [2, 1, 3, 0]
    size = len(array)
    print(solve(array, size))
 
# This code is contributed by Rituraj Jain
C#



// C# implementation of the approach
using System;
 
class GFG
{
     
// Function to return the parity of a number
static int parity(int a)
{
    return a % 3;
}
 
// Function to return the minimum
// number of operations required
static int solve(int []array, int size)
{
    int operations = 0;
    for (int i = 0; i < size - 1; i++)
    {
 
        // Operation needs to be performed
        if (parity(array[i]) == parity(array[i + 1]))
        {
 
            operations++;
            if (i + 2 < size)
            {
 
                // Parity of previous element
                int pari1 = parity(array[i]);
 
                // Parity of next element
                int pari2 = parity(array[i + 2]);
 
                // Update parity of current
                // element to be other than
                // the parities of the previous
                // and the next number
                if (pari1 == pari2)
                {
                    if (pari1 == 0)
                        array[i + 1] = 1;
                    else if (pari1 == 1)
                        array[i + 1] = 0;
                    else
                        array[i + 1] = 1;
                }
                else
                {
                    if ((pari1 == 0 && pari2 == 1) ||
                        (pari1 == 1 && pari2 == 0))
                        array[i + 1] = 2;
                    if ((pari1 == 1 && pari2 == 2)
                        || (pari1 == 2 && pari2 == 1))
                        array[i + 1] = 0;
                    if ((pari1 == 2 && pari2 == 0)
                        || (pari1 == 0 && pari2 == 2))
                        array[i + 1] = 1;
                }
            }
        }
    }
 
    return operations;
}
 
// Driver Code
public static void Main()
{
    int []array = { 2, 1, 3, 0 };
    int size = array.Length;
    Console.WriteLine(solve(array, size));
}
}
 
// This code is contributed
// by Akanksha Rai
PHP



<?php
// PHP implementation of the approach
 
// Function to return the parity of a number
function parity($a)
{
    return $a % 3;
}
 
// Function to return the minimum
// number of operations required
function solve($array, $size)
{
    $operations = 0;
    for ($i = 0; $i < $size - 1; $i++)
    {
 
        // Operation needs to be performed
        if (parity($array[$i]) == parity($array[$i + 1]))
        {
 
            $operations++;
            if ($i + 2 < $size)
            {
 
                // Parity of previous element
                $pari1 = parity($array[$i]);
 
                // Parity of next element
                $pari2 = parity($array[$i + 2]);
 
                // Update parity of current element to be
                // other than the parities of the previous
                // and the next number
                if ($pari1 == $pari2)
                {
                    if ($pari1 == 0)
                        $array[$i + 1] = 1;
                    else if ($pari1 == 1)
                        $array[$i + 1] = 0;
                    else
                        $array[$i + 1] = 1;
                }
                else
                {
                    if (($pari1 == 0 && $pari2 == 1) ||
                        ($pari1 == 1 && $pari2 == 0))
                        $array[$i + 1] = 2;
                    if (($pari1 == 1 && $pari2 == 2) ||
                        ($pari1 == 2 && $pari2 == 1))
                        $array[$i + 1] = 0;
                    if (($pari1 == 2 && $pari2 == 0) ||
                        ($pari1 == 0 && $pari2 == 2))
                        $array[$i + 1] = 1;
                }
            }
        }
    }
 
    return $operations;
}
 
// Driver Code
$array = array(2, 1, 3, 0 );
$size = count($array);
echo solve($array, $size);
 
// This code is contributed by mits
?>
Javascript



<script>
 
// Javascript implementation of the approach
 
// Function to return the parity of a number
function parity(a)
{
    return a % 3;
}
 
// Function to return the minimum
// number of operations required
function solve(array, size)
{
    var operations = 0;
    for (var i = 0; i < size - 1; i++) {
 
        // Operation needs to be performed
        if (parity(array[i]) == parity(array[i + 1])) {
 
            operations++;
            if (i + 2 < size) {
 
                // Parity of previous element
                var pari1 = parity(array[i]);
 
                // Parity of next element
                var pari2 = parity(array[i + 2]);
 
                // Update parity of current element to be other than
                // the parities of the previous and the next number
                if (pari1 == pari2) {
                    if (pari1 == 0)
                        array[i + 1] = 1;
                    else if (pari1 == 1)
                        array[i + 1] = 0;
                    else
                        array[i + 1] = 1;
                }
                else {
                    if ((pari1 == 0 && pari2 == 1)
                        || (pari1 == 1 && pari2 == 0))
                        array[i + 1] = 2;
                    if ((pari1 == 1 && pari2 == 2)
                        || (pari1 == 2 && pari2 == 1))
                        array[i + 1] = 0;
                    if ((pari1 == 2 && pari2 == 0)
                        || (pari1 == 0 && pari2 == 2))
                        array[i + 1] = 1;
                }
            }
        }
    }
 
    return operations;
}
 
// Driver Code
var array = [2, 1, 3, 0];
var size = array.length;
document.write( solve(array, size));
   
 
</script>
Output: 
1
 
Time Complexity: O(N )
Auxiliary Space: O(1)



My Personal Notes
arrow_drop_up
Previous
Python - Insert after every Nth element in a list
Next

Convex Hull | Monotone chain algorithm
Recommended Articles
Page :
Minimum integer that can be obtained by swapping adjacent digits of different parity
21, Jan 20
Count of all subsequences having adjacent elements with different parity
09, Jul 20
Minimum flips in a Binary array such that XOR of consecutive subarrays of size K have different parity
26, Mar 20
Minimize the count of adjacent pairs with different parity
14, Apr 20
Minimum number of swaps required to make parity of array elements same as their indices
08, Mar 21
Check if all the elements can be made of same parity by inverting adjacent elements
06, Jan 20
Maximize remainder of sum of a pair of array elements with different parity modulo K
18, Mar 21
Minimum value exceeding X whose count of divisors has different parity with count of divisors of X
18, Nov 20
Maximum Sum Subsequence made up of consecutive elements of different parity
23, May 21
Minimum increments to modify array such that value of any array element can be splitted to make all remaining elements equal
25, Dec 20
Minimum subarray reversals required such that sum of all pairs of adjacent elements is odd
05, Nov 20
Minimum decrements required such that sum of all adjacent pairs in an Array does not exceed K
21, Aug 20
Minimize swaps to rearrange array such that parity of index and corresponding element is same
18, Jun 20
Count pairs of same parity indexed elements with same MSD after replacing each element by the sum of maximum digit * A and minimum digits * B
08, Mar 21
Minimum operations required to change the array such that |arr[i] - M| <= 1
06, May 19
Modify array to another given array by replacing array elements with the sum of the array
12, Feb 21
Minimum increments required to make absolute difference of all pairwise adjacent array elements even
19, Apr 21
Minimum number of swaps required to minimize sum of absolute differences between adjacent array elements
13, May 21
Minimize insertions required to make ratio of maximum and minimum of all pairs of adjacent array elements at most K
03, Mar 21
Modify array by merging elements with addition such that it consists of only Primes.
10, May 20
Minimize cost to modify the Array such that even indices have even elements and vice versa
15, Oct 21
Minimize subtraction followed by increments of adjacent elements required to make all array elements equal
22, Mar 21
Sum of elements from an array having even parity
21, Dec 18
Count of all possible pairs of array elements with same parity
20, Jun 20
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
krikti
@krikti
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