Beginner
1. Consecutive Prime Sum2. Alpha Numeric Sorting3. Longest Progressive Sequence4. Divine Divisor5. Forest Fire6. Minimum Distance7. Saving for a rainy day8. Online Communities Even Groups9. Coin Distribution10. Bank Compare11. Counting Rock Samples12. Collecting Candies13. Game Of Primes14. Kth Largest Factor15. Jumble With Numbers16. Philand Coins17. Reverse Gear18. String Rotation19. The Vita Sum20. Mountain Peak Sequence21. LAZY STUDENT22. LOGIC PYRAMID23. Super ASCII String Checker24. Min Product Array25. String Of Brackets26. Exchange Of Digits27. Marathon Winner28. Common Steps29. Swayamvar30. Digit Pairs31. Dole Out Cadbury32. Petrol Pump33. Grooving Monkeys34. Death BattleSuper ASCII String Checker
LEVEL:Beginner
Description
In the Byteland country a string 'S' is said to super ascii string if and only if count of each character in the string is equal to its ascii value.
In the Byteland country ascii code of 'a' is 1, 'b' is 2 ...'z' is 26.
Your task is to find out whether the given string is a super ascii string or not.
Input Format
First line contains number of test cases T, followed by T lines, each containing a string "S".
Constraints:
1<=T<=100
1<=|S|<=400, S will contains only lower case alphabets ('a'-'z').
Output Format
For each test case print "Yes" if the String "S" is super ascii, else print "No"
2 bba scca
Yes No
2 bbaa ddddccca
No Yes
2 bbaa scca
No No
Login to see Discussion
Approach
Maintaining a count array, which stores the count of the characters at their (ascii-1) positions. At last iterate through the count array, by maintaining a flag value, if the count at that position is greater than the ascii, set the flag to '0' and break the loop.
Note :
Let us know if you can come up with a better approach, mail us at support@theinquisitive.in Your approach will be reviewed and posted with credits to you.
Login to see Solution