#1876
Substrings of Size Three with Distinct Characters
newbie · 210 · lc easy +16 · premium · verified · 76.6% accepted · 1,684 likes · top 88%
Description
A string is good if no character appears more than once in it.
Given a string s, return the number of substrings of length exactly 3 that qualify as good. Count each occurrence independently.
Example 1:
Input: s = "xyzzaz"
Output: 1
Explanation: There are 4 substrings of size 3: "xyz", "yzz", "zza", and "zaz".
The only good substring of length 3 is "xyz".
Example 2:
Input: s = "aababcabc"
Output: 4
Explanation: There are 7 substrings of size 3: "aab", "aba", "bab", "abc", "bca", "cab", and "abc".
The good substrings are "abc", "bca", "cab", and "abc".
Code
1
2
3