@@ -0,0 +1,1457 @@
+package thirty_days_of_code;%0D%0A%0D%0Aimport java.util.Scanner;%0D%0Aimport java.util.StringTokenizer;%0D%0A%0D%0A/*%0D%0A * Problem Statement:%0D%0A * Given a string S, find number of words in that string. For this problem a%0D%0A * word is defined by a string of one or more English letters.%0D%0A * %0D%0A * Note: Space or any of the special characters like %5B!,?.%5C_'@%5D+ will act as a%0D%0A * delimiter.%0D%0A * %0D%0A * Input Format:%0D%0A * The string can be defined by following regular expression:%0D%0A * %0D%0A * %5BA-Za-z !,?.%5C_'@%5D+%0D%0A * That means the string will only contain english letters, blank spaces and%0D%0A * this%0D%0A * special characters: %5B!,?.%5C_'@%5D+.%0D%0A * %0D%0A * Constraints:%0D%0A * 1 %3C= %7CS%7C %3C= 400000%0D%0A * %0D%0A * Output Format:%0D%0A * In the first line, print number of words in the string. The words don't need%0D%0A * to be unique. Also print each word in a separate line.%0D%0A * %0D%0A * Sample Input: %0D%0A * He is a very very good boy, isn't he?%0D%0A * %0D%0A * Sample Output: %0D%0A * 10%0D%0A * He%0D%0A * is%0D%0A * a%0D%0A * very%0D%0A * very%0D%0A * good%0D%0A * boy%0D%0A * isn%0D%0A * t%0D%0A * he%0D%0A */%0D%0Apublic class MoreStringMethods %7B%0D%0A%0D%0A    public static void main(String%5B%5D args) %7B%0D%0A        Scanner sc = new Scanner(System.in);%0D%0A%0D%0A        String input = sc.nextLine();%0D%0A%0D%0A        StringTokenizer st = new StringTokenizer(input, %22%5B%5D %5Ct%5Cn%5Cr%5Cf!,?.%5C%5C_'@+%22);%0D%0A        int numTokens = st.countTokens();%0D%0A%0D%0A        System.out.println(numTokens);%0D%0A        while (st.hasMoreTokens()) %7B%0D%0A            System.out.println(st.nextToken());%0D%0A        %7D%0D%0A        sc.close();%0D%0A    %7D%0D%0A%7D

Add MoreStringMethods