Find K-Length Substrings With No Repeated Characters: coding question

Available question text

Given a string s and integer k, return all (distinct) length-k substrings that contain no repeated characters. This is solved by a sliding-window with a character count or set to maintain uniqueness and efficiently collect valid substrings.

Continue with questions that share topics or the same question type.

Count Redundant Substrings Where Length Equals a*Vowels + b*Consonants
Coding
Count Substrings With K-Frequency Characters I
Coding
Count Substrings With K-Frequency Characters II
Coding
Count Unique Characters of All Substrings of a Given String
Coding

Sources · 1 reference

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 1 record

No company association
Leetcode 1100. Find K-Length Substrings With No Repeated Characters
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source

Find K-Length Substrings With No Repeated Characters

Available question text

Related questions

Find K-Length Substrings With No Repeated Characters

Available question text

Related questions