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
Idħol biex tara l-istorja tas-sottomissjonijiet
IdħolIdħol biex tuża l-Mentor tal-AI
IdħolTests12
Visible tests
Test moħbi 7
Test moħbi 8
Test moħbi 9
Test moħbi 10
Test moħbi 11
Test moħbi 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