Find K-Length Substrings With No Repeated Characters
Given a string s and an integer k, return the number of substrings in s of length k with no repeated characters.
Example 1:
Input: s = "havefunonneetcode", k = 5
Output: 6Explanation:
There are 6 substrings they are: 'havef','avefu','vefun','efuno','etcod','tcode'.Example 2:
Input: s = "home", k = 5
Output: 0Explanation: Notice k can be larger than the length of s. In this case, it is not possible to find any substring.
Constraints:
1 <= s.length <= 10^4sconsists of lowercase English letters1 <= k <= 10^4