All submissions for this problem are available.Unfortunately **Semcrack** has lost its employee data. The data is very necessary hence **Semcrack** wants to recover it. The only source to recover the data is a string consists of first letter of employee's name. With the recovery algorithm **Semcrack** can only recover the number of employee groups in organization. A group of employee is consists of even number of employee's. But recently the recovery algorithm has been stolen by a group of hackers. **Semcrack** wants your help to recover it's data. Design an algorithm for the same. Note that the group can only contain the continuous letters from the given string. ###Input: - First line will contain $T$, number of testcases. Then the testcases follow. - The first and only line of each testcase contains of a single line of input, a string of length $N$. ###Output: For each testcase, output in a single line the total number of emplyee groups possible. ###Constraints - $1 \leq T \leq 10^5$ - $1 \leq N \leq 10^5$ ###Subtasks - 30 points : $1 \leq T \leq 100$ - 70 points : $1 \leq T \leq 10^5$ ###Sample Input: 2 asdf amb ###Sample Output: 4 2 ###Explanation: In first case, **ad** and **sf** can't form a group , because skipping of characters are not allowed.
|Time Limit:||0.2 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, rust, SCALA, swift, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, kotlin, PERL6, TEXT, SCM chicken, CLOJ, COB, FS|
Fetching successful submissions