Earlier Tail Matches
This function is good practice for finding a small pattern inside a string. Write a function last2 that takes a string s, looks at its last two characters, and counts how many times the same pair appeared earlier in the string. Do not count the final occurrence itself, because it is the ending you are comparing against.
Примеры
Ввод
"hixxhi"Вывод
1Ввод
"xaxxaxaxx"Вывод
1Ввод
"axxxaxaxx"Вывод
2Нужно реализовать
def last2(s: str) -> int:
Теги
stringssliding-window
Inicia sesión para ver tu historial de envíos
Iniciar sesiónInicia sesión para usar el AI Mentor
Iniciar sesiónTests12
Visible tests
Prueba oculta 7
Prueba oculta 8
Prueba oculta 9
Prueba oculta 10
Prueba oculta 11
Prueba oculta 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