{CodeRoyale}
All challenges
Multiple ChoiceIntermediate 30s

collections.deque

Choose the best answer for: deque
Options
  1. 1deque is a LIFO queue optimized for single-end push
  2. 2deque is a FIFO stack requiring O(n) shift on pop
  3. 3deque supports O(1) append/pop from both ends
  4. 4deque is slower than list for all append and pop
pythonintermediate

Think you can answer under pressure?

Get matched and answer live questions in 3-minute 1v1 battles. Elo ranking, badge tiers and bragging rights on the line.

Play this in a 3-minute battle