Associate Software Engineer

You are given an odd number in the form of a string, ‘S.’ Your goal is to convert the number into an even number such that the following two conditions are satisfied.

You can use swap operation over any two indices i,e you can choose two indices 'i' and 'j' and swap the digits present at S[i] and S[j]. But this operation can be used only once.

Your final even number should be the largest out of all other possible even numbers.

Note:

If it isn’t possible to make an even number print -1

Ninja has an ‘N’ character long string. He observed that the string consists of the same adjacent letters. So, he thought to remove some characters from the string using this operation.

In one operation, we can delete a substring having ‘K’ same adjacent characters. causing the left and the right side of the deleted substring to concatenate together.

Ninja applied this operation as many times as possible.

Your task is to find the resultant string after all operations.

You are given a string ‘S’ having ‘N’ lowercase letters and an integer ‘K’. Find the resultant string after all the operations are done.

For Example

If the given string S = “abcbaacd” and k = 2. In the first operation, we will remove ‘aa’ from the string. After that, we will concatenate the left and right strings as the resultant string will be “abcb” + “cd” = “abcbcd”.

Where do you live?

Are you comfortable in working different shifts?