Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
[Deque.popleft()] [Deque.append()] [Speedy] [Clear] [Algorithmic] solution in Speedy category for Replace First by sanddro
from typing import Iterable, List, Any
from collections import deque
def replace_first(items: List[Any]) -> Iterable[Any]:
dq = deque(items)
if len(dq) > 1:
dq.append(dq.popleft())
return dq
Jan. 20, 2025
Comments:
