Please enter your email address or userHandle.
Given a string, print the number of alphabets present in the string.
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.
Print the number of alphabets present in the string.
1<=size of string <=100
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Login to access your submissions.
Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.