You are given an array of strings chunks and an array of strings queries.

First, concatenate all strings in chunks in order to form a single text string s.

The string s is divided into words according to the following rules:

• Words consist of lowercase English letters and joiner hyphens '-'.

• A hyphen '-' is considered a joiner hyphen if and only if it is immediately preceded and immediately followed by a lowercase English letter.

• Any character that is not part of a valid word (such as spaces and non joiner hyphens) serves as a separator.

• Consecutive separators are treated as a single delimiter.

For each query in queries, determine how many times queries[i] appears as an exact full word in s.

Return an integer array where the $i$-th element is the frequency of queries[i] in s.

Constraints:

• $1 \leq$ chunks.length $\leq 10^5$

• $1 \leq$ chunks[i].length $\leq 10^5$

• The total length of all strings in chunks does not exceed $10^5$.

• chunks[i] consists only of lowercase English letters, spaces, and '-'.

• $1 \leq$ queries.length $\leq 10^5$

• $1 \leq$ queries[i].length $\leq 10^5$

• The total length of all strings in queries does not exceed $10^5$.

• queries[i] consists only of lowercase English letters and '-'.

• queries[i] is a valid word: it does not start or end with '-', and it does not contain $2$ consecutive hyphens.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.