Multiple ChoiceIntermediate 30s
Deque data structure
A double-ended queue allows:
Options
- 1First-in-first-out removal only at front
- 2Last-in-first-out removal only at the back
- 3Random access by numeric index only
- 4Insert/remove from both ends in O(1)
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.