<doocs>1100.Find K-Length Substrings With No Repeated Characters_1.py
def numKLenSubstrNoRepeats( s: str, k: int) -> int:
    ans = j = 0
    mp = {}
    for i, c in enumerate(s):
        if c in mp:
            j = max(j, mp[c] + 1)
        mp[c] = i
        if i - j + 1 >= k:
            ans += 1
    return ans
def sample_funcname ( var_0 : str , var_2 : int ) -> int :
    var_6 = var_4 = 0
    var_7 = { }
    for var_9 , var_10 in enumerate ( var_0 ) :
        if var_10 in var_7 :
            var_4 = max ( var_4 , var_7 [ var_10 ] + 1 )
        var_7 [ var_10 ] = var_9
        if var_9 - var_4 + 1 >= var_2 :
            var_6 += 1
    return var_6
