[LeetCode] 3325. Count Substrings With K-Frequency Characters I
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. Example 1:Input: s = “abacb”, k = 2Output: 4 Explanation: