deque vs list for front removal

Question

Accepted Answer

A Python list is backed by a contiguous array. Removing from position 0 requires shifting every remaining element one slot to the left, which is O(n). A deque uses a doubly-linked block structure so it can remove from either end in O(1). For BFS queues or any pattern that repeatedly pulls from the front, this difference matters a lot at scale.