Leetcode 3325. Count Substrings With K-Frequency Characters I

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.