Available question text
Count the number of substrings of s that contain at least one character appearing at least k times. The core challenge is to efficiently enumerate/count such substrings using frequency tracking over substrings (n ≤ 3000, lowercase letters) rather than repeatedly rescanning.
Related questions
Continue with questions that share topics or the same question type.
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 3325. Count Substrings With K-Frequency Characters I
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source