Your question is O(1) Deque Operations. Take a moment with it on the right.
Talk me through your thinking if you like. When you're confident, submit your answer and I'll grade it like a real screen (7/10 or better passes).
Which data structures can be erased from its beginning and end in O(1) time?