Product Engineering Intern

You are given an array ‘ARR’ of size ‘N’. The array contains ‘N’ positive integers.

You want to sort the array in ascending order by doing some operations.

In one operation, you can select two adjacent indexes and swap them if the parity of both values is not the same. In other words, you can only swap two elements if they are adjacent and one is odd, and the other is even.

Can you tell if you can sort the array?

Example :

N = 4
ARR =[ 1, 0, 3, 2 ]
If we swap ‘1’ and ‘0’ and ‘3’ and ‘2’, after applying these operations, our array becomes sorted. So ‘ANS’ is ‘1’.

Given a positive integer ‘N’, you need to find the number of integers between 1 and N(both inclusive), that have at least one digit repeated.

For Example:

If N = 12, then only ‘11’ has repeated digits. Therefore the number of integers between 1 and 12 that have at least one digit repeated = 1.