Count Substrings With K-Frequency Characters II

Try to solve the Count Substrings With K-Frequency Characters II problem.

We'll cover the following

Statement

Given a string s and an integer k, return the total number of substrings of s where at least one character appears at least k times.

Note: A substring is a contiguous sequence of characters within a string. For example, "edu" is a substring of "educative". 

Constraints:

  • 1≤1 \leq s.length ≤3×103\leq 3 \times 10^{3}

  • 1≤1 \leq k ≤\leq s.length

  • s consists only of lowercase English letters.

Examples

Level up your interview prep. Join Educative to access 80+ hands-on prep courses.