Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Compare Strings Formed by Linked Lists
Coding
- File System Block Storage: Parse Strings into 8-Character Blocks with Capacity Validation
Coding
- Minimum Substring Partition of Equal Character Frequency
Coding · Counting · Dynamic Programming · Hash Table
- Strings Differ by One Character
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1170. Compare Strings by Frequency of the Smallest Character
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source