Leetcode Problem 1100. Find K-Length Substrings With No Repeated Characters

1100. Find K-Length Substrings With No Repeated Characters

Leetcode Solutions

Initialize a frequency array of size 26 to keep track of character counts.
Initialize two pointers, left and right, both set to 0.
Initialize a variable count to keep track of the number of valid substrings.
Iterate with the right pointer over the string s. a. Increment the frequency of the character at the right pointer. b. While the frequency of the current character is greater than 1, decrement the frequency of the character at the left pointer and increment left. c. If the window size (right - left + 1) is equal to k, increment count. d. If the window size is equal to k, decrement the frequency of the character at the left pointer and increment left.
Return count.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen