1
class Solution {
2
public int countGoodSubstrings(String s) {
3
int res = 0;
4

5
for (int i = 2; i < s.length(); i++)
6
if (s.charAt(i) != s.charAt(i - 1)
7
&& s.charAt(i) != s.charAt(i - 2)
8
&& s.charAt(i - 1) != s.charAt(i - 2)) res++;
9
return res;
10
}
11
}

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0