Count number of words
Submissions: 2889   Accuracy:

14.39%

  Difficulty: Easy   Marks: 2

Given a string consisting of spaces,\t,\n and lower case  alphabets.Your task is to count the number of words where spaces,\t and \n work as separators.

Input:
The first line of input contains an integer T denoting the number of test cases.Each test case consist of a string.

Output:
Print the number of words present in the string.

Constraints:
1<=T<=100

Example:
Input:
2
abc\t\ndef   ghi
one   two   three  \t  four
Output:
3
4

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

Contributor: Shubham Chaudhary
Author: Shubham Chaudhary gfg


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.