Word Occurrence Counting

Given a string 'S' of words, the goal is to determine the frequency of each word in the string. Consider a word as a sequence of one or more non-space characters. The string can have multiple spaces between words and may include leading or trailing spaces.

Input:

The input is a single line containing a string 'S'.

Output:

Outputs each unique word and its frequency of occurrence, separated by a space, on separate lines for each word.

Example:

Input: "what we think we become" Output: "what 1", "we 2", "think 1", "become 1"

Constraints:

0

Question

Word Occurrence Counting

Given a string 'S' of words, the goal is to determine the frequency of each word in the string. Consider a word as a sequence of one or more non-space characters. The string can have multiple spaces between words and may include leading or trailing spaces.

Input:

The input is a single line containing a string 'S'.

Output:

Outputs each unique word and its frequency of occurrence, separated by a space, on separate lines for each word.

Example:

Input: "what we think we become"
Output: "what 1", "we 2", "think 1", "become 1"

Constraints:

0 <= |S| <= 10⁵
Time Limit: 1 second

Note:

The order of the printed words does not matter.

Accepted Answer

Count the frequency of each unique word in a given string, handling multiple spaces and ignoring leading/trailing spaces.

Input Handling: Trim the string to remove leading/trailing spaces and split it by spaces to get individual words.
Word Counting: Use a dictionary to count occurrences of each word as you iterate through the list of words.
Output Format: Print each unique word along with its count, ensuring each output is on a new line.
Example: For input 'hello world hello', output should be 'hello 2', 'world 1'.
Efficiency: The solution should handle up to 100,000 characters efficiently within the time limit.