Senior Software Engineer

You are given two arrays ‘arr1’ and ‘arr2’ of the same length. The beauty of ‘arr1’ is defined as the count of the total number of indices ‘i’ such that ‘arr1[i]’ > ‘arr2[i]’.

In order to maximize the beauty of ‘arr1’ you can reorder its element in any way you want i.e you can swap any possible pair of indexes in ‘arr1’ any number of times.

You need to return any array that is made from ‘arr1’ after reordering its element such that the beauty of the returned array is maximum possible.

Note :

There can be more than one possible array with maximum beauty. In that case, you can return any of them.

Given an array 'arr' with 'n' elements, the task is to rotate the array to the left by 'k' steps, where 'k' is non-negative.

Example:

'arr '= [1,2,3,4,5]
'k' = 1  rotated array = [2,3,4,5,1]
'k' = 2  rotated array = [3,4,5,1,2]
'k' = 3  rotated array = [4,5,1,2,3] and so on.

Ninja has been given a program to do basic string compression. For a character that is consecutively repeated more than once, he needs to replace the consecutive duplicate occurrences with the count of repetitions.

Example:

If a string has 'x' repeated 5 times, replace this "xxxxx" with "x5".

The string is compressed only when the repeated character count is more than 1.

Note :

The consecutive count of every character in the input string is less than or equal to 9.