Count Alphabets
Submissions: 3046   Accuracy:

42.45%

  Difficulty: School   Marks: 0
*School Problem's Submission isn't counted in score!

Given a string, print the number of alphabets present in the string.

Input:

The first line of input contains an integer T denoting the number of test cases. The description of T test cases follows.Each test case contains a single string. 


Output:

Print the number of alphabets present in the string.

Constraints:

1<=T<=30

1<=size of string <=100


Example:

Input:

2
adjfjh23
njnfn_+-jf

Output:

6
7

** For More Input/Output Examples Use 'Expected Output' option **

Author: jain_rishabh


If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.

to report an issue on this page.