Given a string s, find the minimum number of changes required to it so that all substrings of the string become distinct.
Note: length of string is atmost 26.
The first line contains an integer T, number of test cases. For each testcase there is only one line containing s atmost 26 characters.
For each testcase in new line, print the minimum number of changes to the string.
1 <= T <= 100
1 <= |s| <= 26
Testcase 1: If we change one instance of 'a' to any character from 'c' to 'z', we get all distinct substrings. Testcase 2: We need to change 2 a's, 2 b's and 4 e's to get distinct substrings. Testcase 3: As no change is required hence 0.