Intern

You are given a string of lowercase characters. Your task is to rearrange (reorder) the string in such a way that no two adjacent characters are the same.

You have to return the rearranged string. If there exists more than one solution you can return any of them.If there is no such string you have to return “NO SOLUTION”. If your returned value is correct the program will print ‘CORRECT’ else ‘INCORRECT’.

For example :

If we are given a string "aabb", then the possible solutions are:

(i) abab
(ii) baba

We can see no two adjacent characters are the same in both strings.

So both (i) and (ii) are valid solutions.

You are given a string (STR) of length N, consisting of only the lower case English alphabet.

Your task is to remove all the duplicate occurrences of characters in the string.

For Example:

If the given string is:
abcadeecfb

Then after deleting all duplicate occurrences, the string looks like this:
abcdef

What is virtual memory?

• What are joins?
• Explain normalisation?
• Define Acid Properties?

• Comment on your personality
• Why do you think we should hire you?
• What are the skills that you want to gain in near future?
• What are your salary expectations?