Occurrence of Each Word: Problem Statement

You are given a string S consisting of several words. Your task is to count the number of times each word appears in string S. A word is defined as a sequence of one or more non-space characters. Note that the string can have multiple spaces between words and may also have leading or trailing spaces.

Example:

Input:

"what we think we become"

Output:

"what" 1 "we" 2 "think" 1 "become" 1

Explanation:

The words "what", "think", and "become" each occur once, while the word "we" occurs twice in the given string.

Constraints:

0

Question

Occurrence of Each Word: Problem Statement

You are given a string S consisting of several words. Your task is to count the number of times each word appears in string S. A word is defined as a sequence of one or more non-space characters. Note that the string can have multiple spaces between words and may also have leading or trailing spaces.

Example:

Input:

 "what we think we become"

Output:

"what" 1
"we" 2
"think" 1
"become" 1

Explanation:

The words "what", "think", and "become" each occur once, while the word "we" occurs twice in the given string.

Constraints:

0 <= |S| <= 10^5
Time Limit: 1 sec

Input:

The input consists of a single line containing string S.

Output:

Output each unique word with its occurrence count on a new line. The word and count should be separated by a space.

Note:

You can produce the output in any order.

Accepted Answer

package com.practice.newstart; import java.util.HashMap; import java.util.Map; import java.util.StringTokenizer; public class PrintUniqueWords { public static void main(String[] args) { printWords("what we think we become"); } private static void printWords(String s) { StringTokenizer str = new StringTokenizer(s," "); Map hm = new HashMap(); while(str.hasMoreTokens()) { String token = str.nextToken(); hm.put(token, hm.getOrDefault(token, 0)+1); } for(Map.Entry e : hm.entrySet()) { System.out.println("Word :"+e.getKey()+" occured:"+e.getValue()); } } }