Leetcode 622. Design Circular Queue

Implement a fixed-size circular queue (ring buffer) supporting enqueue, dequeue, Front/Rear, isEmpty and isFull operations without using built-in queue types. The core challenge is to maintain head/tail indices (and size or a reserved slot) with wrap-around so all operations run in O(1) while correctly distinguishing empty vs full.