Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Rearrange array such that all even-indexed elements in the Array is even

  • Difficulty Level : Medium
  • Last Updated : 04 May, 2021

Given an array arr[], the task is to check if it is possible to rearrange the array in such a way that every even index(1-based indexing) contains an even number. If such a rearrangement is not possible, print “No”. Otherwise, print “Yes” and print a possible arrangement

Examples:

Input: arr[] = {2, 4, 8, 3, 1} 
Output: 
Yes 
3 4 8 2 1
Input: arr[] = {3, 3, 11, 8} 
Output: No 
Explanation: Since, the array contains only one even element, all even indices cannot be filled with a even elements.

Approach: 
Follow the steps below to solve the problem: 

  • Count the total number of even elements present in the given array. If the count exceeds the total number of even indices in the given array, print “No”.
  • Otherwise, print “Yes”. Now, traverse the array using two pointers, i and j, pointing to even and odd indices respectively.
  • For any ith index containing an odd element, iterate odd indices using j until an even element is encountered.
  • Swap a[i] and a[j]
  • Repeat the above steps until all even indices are filled with an even element.

Below is the implementation of the above approach:

C++




// C++ Program to implement
// the above approach
#include <bits/stdc++.h>
using namespace std;
 
// Function to check if it the
// array can be rearranged such
// such that every even indices
// contains an even element
void checkPossible(int a[], int n)
{
    // Stores the count of even elements
    int even_no_count = 0;
 
    // Traverse array to count even numbers
    for (int i = 0; i < n; i++)
    {
        if (a[i] % 2 == 0)
            even_no_count++;
    }
 
    // If even_no_count exceeds
    // count of even indices
    if (n / 2 > even_no_count)
    {
        cout << "No" << endl;
        return;
    }
 
    cout << "Yes" << endl;
    int j = 0;
    for (int i = 1; i < n; i += 2)
    {
        if (a[i] % 2 == 0)
            continue;
        else
        {
            while (j < n && a[j] % 2 != 0)
                j += 2;
 
            a[i] += a[j];
            a[j] = a[i] - a[j];
            a[i] -= a[j];
        }
    }
 
    for (int i = 0; i < n; i++)
    {
        cout << a[i] << " ";
    }
}
 
// Driver Code
int main()
{
 
    int arr[] = { 2, 3, 4, 5, 6, 7 };
    int n = sizeof(arr) / sizeof(arr[0]);
    checkPossible(arr, n);
    return 0;
}
 
// This code is contributed by gauravrajput1
Java



// Java Program to implement
// the above approach
import java.io.*;
import java.util.*;
 
class GFG {
 
    // Function to check if it the
    // array can be rearranged such
    // such that every even indices
    // contains an even element
    static void checkPossible(int a[])
    {
        // Stores the count of even elements
        int even_no_count = 0;
 
        // Traverse array to count even numbers
        for (int i = 0; i < a.length; i++) {
 
            if (a[i] % 2 == 0)
                even_no_count++;
        }
 
        // If even_no_count exceeds
        // count of even indices
        if (a.length / 2 > even_no_count) {
            System.out.println("No");
            return;
        }
 
        System.out.println("Yes");
        int j = 0;
        for (int i = 1; i < a.length; i += 2) {
            if (a[i] % 2 == 0)
                continue;
            else {
                while (j < a.length && a[j] % 2 != 0)
                    j += 2;
 
                a[i] += a[j];
                a[j] = a[i] - a[j];
                a[i] -= a[j];
            }
        }
 
        for (int i = 0; i < a.length; i++) {
            System.out.print(a[i] + " ");
        }
    }
 
    // Driver Code
    public static void main(String args[])
    {
 
        int arr[] = { 2, 3, 4, 5, 6, 7 };
 
        checkPossible(arr);
    }
}
Python3



# Python3 program to implement
# the above approach
 
# Function to check if it the
# array can be rearranged such
# such that every even indices
# contains an even element
def checkPossible(a, n):
     
    # Stores the count of even elements
    even_no_count = 0
 
    # Traverse array to count even numbers
    for i in range(n):
        if (a[i] % 2 == 0):
            even_no_count += 1
     
    # If even_no_count exceeds
    # count of even indices
    if (n // 2 > even_no_count):
        print("No")
        return
     
    print("Yes")
    j = 0
     
    for i in range(1, n, 2):
        if (a[i] % 2 == 0):
            continue
             
        else:
            while (j < n and a[j] % 2 != 0):
                j += 2
 
            a[i] += a[j]
            a[j] = a[i] - a[j]
            a[i] -= a[j]
         
    for i in range(n):
        print(a[i], end = " ")
     
# Driver Code
arr = [ 2, 3, 4, 5, 6, 7 ]
n = len(arr)
 
checkPossible(arr, n)
 
# This code is contributed by code_hunt
C#



// C# Program to implement
// the above approach
using System;
class GFG{
 
  // Function to check if it the
  // array can be rearranged such
  // such that every even indices
  // contains an even element
  static void checkPossible(int []a)
  {
    // Stores the count of even elements
    int even_no_count = 0;
 
    // Traverse array to count even numbers
    for (int i = 0; i < a.Length; i++)
    {
      if (a[i] % 2 == 0)
        even_no_count++;
    }
 
    // If even_no_count exceeds
    // count of even indices
    if (a.Length / 2 > even_no_count)
    {
      Console.WriteLine("No");
      return;
    }
 
    Console.WriteLine("Yes");
    int j = 0;
    for (int i = 1; i < a.Length; i += 2)
    {
      if (a[i] % 2 == 0)
        continue;
      else
      {
        while (j < a.Length && a[j] % 2 != 0)
          j += 2;
 
        a[i] += a[j];
        a[j] = a[i] - a[j];
        a[i] -= a[j];
      }
    }
 
    for (int i = 0; i < a.Length; i++)
    {
      Console.Write(a[i] + " ");
    }
  }
 
  // Driver Code
  public static void Main(String []args)
  {
    int []arr = { 2, 3, 4, 5, 6, 7 };
 
    checkPossible(arr);
  }
}
 
// This code is contributed by Rajput-Ji
Javascript



<script>
// Java Script Program to implement
// the above approach
 
 
    // Function to check if it the
    // array can be rearranged such
    // such that every even indices
    // contains an even element
    function checkPossible(a)
    {
        // Stores the count of even elements
        let even_no_count = 0;
 
        // Traverse array to count even numbers
        for (let i = 0; i < a.length; i++) {
 
            if (a[i] % 2 == 0)
                even_no_count++;
        }
 
        // If even_no_count exceeds
        // count of even indices
        if (a.length / 2 > even_no_count) {
            document.write("No<br>");
            return;
        }
 
        document.write("Yes<br>");
        let j = 0;
        for (let i = 1; i < a.length; i += 2) {
            if (a[i] % 2 == 0)
                continue;
            else {
                while (j < a.length && a[j] % 2 != 0)
                    j += 2;
 
                a[i] += a[j];
                a[j] = a[i] - a[j];
                a[i] -= a[j];
            }
        }
 
        for (let i = 0; i < a.length; i++) {
            document.write(a[i] + " ");
        }
    }
 
    // Driver Code
     
 
        let arr = [ 2, 3, 4, 5, 6, 7 ];
 
        checkPossible(arr);
 
// This code is contributed by sravan kumar Gottumukkala
</script>
 
 
Output: 
Yes
3 2 5 4 7 6
 
Time Complexity: O(N) 
Auxiliary Space: O(1)
 

My Personal Notes
arrow_drop_up
Previous
Spearman's Rank Correlation
Next

Python - List Words Frequency in String
Recommended Articles
Page :
Rearrange sorted array such that all odd indices elements comes before all even indices element
09, Sep 21
Rearrange array such that even index elements are smaller and odd index elements are greater
08, Oct 17
Rearrange array such that arr[i] >= arr[j] if i is even and arr[i]<=arr[j] if i is odd and j < i
30, Dec 17
Rearrange array such that even positioned are greater than odd
15, Dec 17
C++ Program to Rearrange array such that arr[i] >= arr[j] if i is even and arr[i]<=arr[j] if i is odd and j < i
30, Dec 21
Java Program to Rearrange array such that arr[i] >= arr[j] if i is even and arr[i]<=arr[j] if i is odd and j < i
30, Dec 21
Python3 Program to Rearrange array such that arr[i] >= arr[j] if i is even and arr[i]<=arr[j] if i is odd and j < i
30, Dec 21
Php Program to Rearrange array such that arr[i] >= arr[j] if i is even and arr[i]<=arr[j] if i is odd and j < i
30, Dec 21
Javascript Program to Rearrange array such that arr[i] >= arr[j] if i is even and arr[i]<=arr[j] if i is odd and j < i
30, Dec 21
Rearrange array by interchanging positions of even and odd elements in the given array
25, Oct 20
Rearrange array elements such that Bitwise AND of first N - 1 elements is equal to last element
05, Nov 19
Rearrange given Array such that each elements is not equal to mean of adjacent elements
17, Aug 21
Rearrange array elements into alternate even-odd sequence by anticlockwise rotation of digits
28, Jan 21
Minimize cost to modify the Array such that even indices have even elements and vice versa
15, Oct 21
Rearrange array such that difference of adjacent elements is in descending order
26, Apr 20
Rearrange an array such that product of every two consecutive elements is a multiple of 4
09, Jul 20
Rearrange array such that sum of same indexed elements is atmost K
01, Nov 20
Rearrange two given arrays such that sum of same indexed elements lies within given range
03, Nov 20
Rearrange a given list such that it consists of alternating minimum maximum elements
15, Aug 16
Absolute difference between sum of even elements at even indices & odd elements at odd indices in given Array
04, Dec 21
Rearrange Odd and Even values in Alternate Fashion in Ascending Order
15, Jan 19
Rearrange the Array to maximize the elements which is smaller than both its adjacent elements
24, Jun 21
Rearrange all elements of array which are multiples of x in increasing order
05, Nov 18
Rearrange all elements of array which are multiples of x in decreasing order
06, Dec 18
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
offbeat
@offbeat
Vote for difficulty
Current difficulty :
Medium





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!