One-Step Stack
Here you need to check whether the values in a stack form a clean increasing chain. Given stack, where the bottom is on the left and the top is on the right, return True if each next element is exactly 1 greater than the previous one. If this order breaks even once, return False.
Примеры
Ввод
[3, 4, 5, 6, 7]Вывод
TrueВвод
[3, 4, 6, 7]Вывод
FalseВвод
[3, 2, 1]Вывод
FalseНужно реализовать
def is_consecutive(stack: list[int]) -> bool:
Теги
stack
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