Double X Counter
Finding short fragments inside a string is useful in text checks, logs, and simple analyzers. Write a function count_xx that takes a string s and counts how many times the substring xx appears in it. Overlapping matches count too, so xxx contains two such pairs.
Примеры
Ввод
"abcxx"Вывод
1Ввод
"xxx"Вывод
2Ввод
"xxxx"Вывод
3Нужно реализовать
def count_xx(s: str) -> int:
Теги
stringssliding-window
Zaloguj się, aby zobaczyć historię rozwiązań
Zaloguj sięZaloguj się, aby korzystać z Mentora AI
Zaloguj sięTests12
Visible tests
Ukryty test 7
Ukryty test 8
Ukryty test 9
Ukryty test 10
Ukryty test 11
Ukryty test 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