Leetcode 641. Design Circular Deque

Implement a fixed-capacity circular double-ended queue that supports O(1) insertions and deletions at both front and rear, plus front/rear access and isEmpty/isFull checks, correctly handling overflow and underflow.