Leetcode 1670. Design Front Middle Back Queue

Design a data structure that supports push and pop at the front, middle, and back of a sequence (when length is even, the middle is the frontmost of the two middle positions), returning -1 for pops on an empty queue. The challenge is to maintain the sequence so these operations behave correctly and efficiently across up to 1000 calls.