Let the function $f(s)$ return the frequency of the lexicographically smallest character in a non empty string $s$.

Given two string arrays queries and words, return an integer array answer where answer[i] represents the count of words w in words such that $f( ext{`queries[i]`}) < f(w)$.

Constraints:

• $1 \leq$ queries.length $\leq 2000$

• $1 \leq$ words.length $\leq 2000$

• $1 \leq$ queries[i].length, words[i].length $\leq 10$

• queries[i][j] and words[i][j] consist of lowercase English letters.

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.