#K55307. Longest Possible String Length
Longest Possible String Length
Longest Possible String Length
You are given a string S
and your task is to compute the length of the longest possible string that can result after performing the removal operations. In this problem, every removal operation still results in the same string length since each character is treated independently. Therefore, the answer is simply the length of the string.
Note: You will be given multiple test cases. For each test case, output the length of the given string.
inputFormat
The first line contains an integer T denoting the number of test cases. Each of the following T lines contains a non-empty string S
.
Input Format Example:
3 abacaba aabbcc abc
outputFormat
For each test case, print the length of the string S
on a new line.
Output Format Example:
7 6 3## sample
2
abacaba
aabbcc
7
6
</p>