LC: 1100. Find K Length Substrings With No Repeated Characters - spiralgo/algorithms GitHub Wiki

1100. Find K-Length Substrings With No Repeated Characters:

The Essence:

In such substrings, the start index should be shifted right until no character in the substring is duplicate. For the simplest case, no character of the end index should be within the substring.

Details:

This can be implemented using sets or boolean arrays for the characters. In general, we set the character before the end index as visited. When the end index is incremented to a point where it is visited, we shift the start index until the duplicate is encountered and excluded from the substring interval.