1100. Find K-Length Substrings With No Repeated Characters

Given a string s and an integer k, return the number of substrings of length k that contain no repeated characters.

A substring is a contiguous sequence of characters in a string.

Examples
Input: ["havefunonleetcode",5]
Output: 6
Hints
Related Problems

1100. Find K-Length Substrings With No Repeated Characters

Given a string `s` and an integer `k`, return the number of substrings of length `k` that contain no repeated characters.