SUPER STRING
Problem
A string is said to be "SUPER STRING" if the number of times the character appeared in the string is equal to its ASCII value. Given the conditions that the ASCII value of ‘a’ is 26 and z is ‘1’.
Input
First line takes number of test cases ‘N’. Following ‘N’ lines take string as input.
Output
‘Yes’ if the string is a super String ‘No’ if string is not a Super String
Time Limit: 5
Memory Limit: 256
Source Limit:
Explanation
'Z' appeared once and 'Y' appeared twice in the first test case so it was a 'Yes' and in second test case 'Z' appeared twice therefore it was a 'No'
