Given an array arr[] consisting of N positive integers, the task is to rotate the digits of array elements in an anti-clockwise direction such that elements of the array elements are in alternate even-odd or odd-even form. If multiple solutions exists, then print any one of them. Otherwise, print -1.
Examples:
Input: arr[] = { 143, 251, 534, 232, 854 }
Output: 143 512 345 232 485
Explanation:Â
Rotating arr[1] by 1 in anticlockwise direction modifies arr[1] to 512.Â
Rotating arr[2] by 1 in anticlockwise direction modifies arr[2] to 345.Â
Rotating arr[4] by 2 in anticlockwise direction modifies arr[4] to 485.Input: arr[] = { 44, 23, 21, 33, 14 }
Output: 44 23 12 33 14
Approach: The above problem can be solved by either modifying the first array element to an odd number or an even number. The array element can be modified by converting the number into a string and then rotate the characters of the string left as needed. Follow the steps below to solve the problem:
- Rearrange the first array element as an even number and check if the remaining array elements can be rearranged into odd-even alternately or not. If found to be true, then rearrange the array elements into odd-even alternately and print the array elements.
- Otherwise, rearrange the first array element as an odd number and check if the remaining array elements can be rearranged into even-odd alternately or not. If found to be true, then rearrange the remaining array elements into even-odd alternately and print the array elements.
- Otherwise, print -1.
Below is the implementation of the above approach:
Python3
# Python program of the above approachÂ
# Utility function to rotate the digits of # array elements such that array elements are# in placed even-odd or odd-even alternatelydef is_possible(arr, check):Â
    # Checks if array can be converted     # into even-odd or odd-even form    exists = TrueÂ
    # Store array elements    cpy = arrÂ
    # Traverse the array    for i in range(len(arr)):Â
        # Check if arr[i] is already        # at correct position         if (arr[i] % 2 == check):            check = not(check)            continueÂ
        # Checks if it is possible        # to modify the number arr[i]        # by rotating the digits of        # the number anticlockwise        flag = FalseÂ
        # Stores the number arr[i] as        # string        strEle = str(arr[i])Â
        # Traverse over the digits of        # the current element        for j in range(len(strEle)):Â
            # Checks if parity of check and            # current digit is same or not            if int(strEle[j]) % 2 == check:Â
                # Rotates the string by j + 1 times                # in anticlockwise                arr[i] = int(strEle[j + 1:] + strEle[:j + 1])Â
                # Marks the flag                # as true and break                flag = True                breakÂ
        # If flag is false        if flag == False:Â
            # Update exists            exists = False            breakÂ
        # Changes the        # parity of check        check = not(check)Â
    # Checks if arr[] cannot be    # modified, then returns false    if not exists:        arr = cpy        return False                      # Otherwise, return True    else:        return TrueÂ
# Function to rotate the digits of array# elements such that array elements are# in the form of even-odd or odd-even formdef convert_arr(arr):Â
    # If array elements can be arranged    # in even-odd manner alternately    if(is_possible(arr, 0)):        print(*arr)Â
    # If array elements can be arranged    # in odd-even manner alternately    elif(is_possible(arr, 1)):        print(*arr)             # Otherwise, prints -1    else:        print(-1)Â
# Driver Codeif __name__ == '__main__':Â Â Â Â Â Â Â Â Â arr = [143, 251, 534, 232, 854]Â Â Â Â convert_arr(arr)Â
    # This code is contributed by ipg2016107. |
314 251 534 223 854
Â
Time Complexity: O(N), as we are using a loop to traverse N times.
Auxiliary Space: O(N), as we are using  extra space for cpy.
Please refer complete article on Rearrange array elements into alternate even-odd sequence by anticlockwise rotation of digits for more details!
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
