Hackerrank

NB NO PLAGIARISM ALLOWED Given a string, a character is said to be superior if it has two neighboring letters that are strictly smaller than itself. We compare characters by their location in the alphabet. More formally, we say that the character at the ith position is superior if a character exists at the position (i-1)th and (i+1)th position, and the character at the ith position is strictly greater than the character at both (i-1)th and (i+1)th positions. Given the frequencies of the 26 lowercase English letters, form a string using all these characters, such that the resultant string has the maximum number of superior characters You need to print the maximum number of superior characters. Complete the function maximumSuperiorCharacters which takes in an array of 26 integers denoting the frequencies of the English letters and returns an integer denoting the maximum number of superior characters. Input Format The first line contains an integer t, denoting the number oftest cases. Each of the next tlines contains 26 space-separated integers denoting the frequencies of the characters from a to z Constraints 1