K50
Design Circular Queue
Problem Statement & Objective
Design your implementation of the circular queue supporting enqueue, dequeue, front, rear, isFull, and isEmpty in O(1).
Function Signature (Python)
design_circular_queue(k: int, operations: list) -> listInput & Output Contract
Output Rule:Her işlem sonucunu içeren liste (boolean veya int).
System Constraints
1 <= k <= 1000
1 <= islemler.length <= 3000
0 <= val <= 1000Example Execution Walkthrough
k = 3, islemler = [['enQueue', 1], ['enQueue', 2], ['enQueue', 3], ['enQueue', 4], ['Rear'], ['isFull'], ['deQueue'], ['enQueue', 4], ['Rear']]
Cevap: [True, True, True, False, 3, True, True, True, 4]Example Test Scenarios (3)
Example 1: Basic Loop
Input:
[3,[["enQueue",1],["enQueue",2],["enQueue",3],["enQueue",4],["Rear"],["isFull"],["deQueue"],["enQueue",4],["Rear"]]]Expected Output:
[true,true,true,false,3,true,true,true,4]Example 2: Boş Durum
Input:
[2,[["Front"],["isEmpty"],["enQueue",5],["Front"],["isEmpty"]]]Expected Output:
[-1,true,true,5,false]Example 3: Kapasite 1
Input:
[1,[["enQueue",10],["isFull"],["deQueue"],["isEmpty"]]]Expected Output:
[true,true,true,true]