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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1170. Compare Strings by Frequency of the Smallest Character

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact