Distinct Three-Letter Windows

Think of this as a small window moving across the string and checking three neighboring characters at a time. Write a function count_good_substrings that counts substrings of length 3 where all characters are different. Return the number of good substrings. If the same good substring appears in different positions, count each occurrence separately.

Примеры

Ввод
"xyzzaz"
Вывод
1
Ввод
"aababcabc"
Вывод
4
Ввод
"abc"
Вывод
1

Нужно реализовать

def count_good_substrings(s: str) -> int:

Теги

stringssliding-windowset
PostgreSQLv16
Entre para enviar

O resultado da execução do código aparecerá aqui

Tests12
Visible tests
Teste oculto 7
Teste oculto 8
Teste oculto 9
Teste oculto 10
Teste oculto 11
Teste oculto 12

They run when you press "Submit" — your whole solution is checked against them so you can't hard-code answers for the visible cases.

Focus radio
Paused · SomaFM · Fluid