Leetcode 1170. Compare Strings by Frequency of the Smallest Character

For each query string, compute the frequency f(s) of its lexicographically smallest character and return how many words have a strictly larger f(w). Because strings are short and lowercase, this reduces to comparing small integer frequencies (≤10), allowing precomputation of word-frequency counts for fast queries.