Skip to content

Latest commit

 

History

History
89 lines (38 loc) · 1.54 KB

README_EN.md

File metadata and controls

89 lines (38 loc) · 1.54 KB

1100. Find K-Length Substrings With No Repeated Characters

中文文档

Description

Given a string S, return the number of substrings of length K with no repeated characters.

 

Example 1:

Input: S = "havefunonleetcode", K = 5

Output: 6

Explanation: 

There are 6 substrings they are : 'havef','avefu','vefun','efuno','etcod','tcode'.

Example 2:

Input: S = "home", K = 5

Output: 0

Explanation: 

Notice K can be larger than the length of S. In this case is not possible to find any substring.

 

Note:

  1. 1 <= S.length <= 10^4
  2. All characters of S are lowercase English letters.
  3. 1 <= K <= 10^4

Solutions

Python3



Java




...