Your question is Queue With O(1) 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).
How would you implement a Queue data structure in JavaScript that supports push(), pop(), pick(), and count() with O(1) complexity?