Practice Design Circular Queue

Implement MyCircularQueue(k) as a fixed-capacity FIFO ring buffer without a built-in queue. enQueue(value) appends unless full and returns success. deQueue() removes the front unless empty and returns success. Front() and Rear() return the corresponding value or -1 when empty. isEmpty() and isFull() report capacity state. Practice approach: Store an array, front index, and entry count. Compute insertion at (front + count) modulo k; removal advances front modulo k. Count distinguishes empty from full even when indices coincide. All operations take O(1) with O(k) storage. Test wraparound, capacity one, and failed insertions without mutation.