Design Circular Queue Problem

Design Circular Queue Problem — ExecCode Easy DSA Practice

Solve the Design Circular Queue problem on ExecCode. Free online easy DSA practice in Design. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Design your implementation of the circular queue. The circular queue has a fixed size and supports enQueue, deQueue, Front, Rear, isEmpty, and isFull operations.

Examples

Input k = 3, ops = ["enQueue", "enQueue", "enQueue", "enQueue", "deQueue", "enQueue", "Front", "Rear"], vals = [1, 2, 3, 4, 0, 4, 0, 0]; Output [true, true, true, false, true, true, 2, 4]. Input k = 3, ops = ["enQueue", "enQueue", "enQueue", "enQueue"], vals = [1, 2, 3, 4]; Output [true, true, true, false]. Input k = 2, ops = ["enQueue", "enQueue", "Front", "deQueue", "Front"], vals = [10, 20, 0, 0, 0]; Output [true, true, 10, true, 20]

Constraints

1 ≤ k ≤ 1000 At most 3000 calls.

Practice Design Circular Queue free on ExecCode. Browse DSA problems, topic map, and placement guides.