Circular Buffer Simulation

Medium Queue: Applications PRO

🔒 Login to Unlock

Problem Statement

Write a C program to simulate a circular buffer of fixed capacity, overwriting oldest data when full upon new enqueues.

Input Format

First line contains capacity and number of operations. Subsequent lines contain operations (1 val for write, 2 for read/dequeue).

Output Format

Print read values separated by spaces.

Constraints

1 <= capacity <= 50, 1 <= ops <= 100

Sample Input

Sample Output

Explanation

Maintain head and tail with fixed capacity. If buffer is full on write, advance the head pointer to overwrite the oldest element.

Starter Code

#include <stdio.h>
#include <stdlib.h>

int main() {
    int cap, ops;
    if (scanf("%d %d", &cap, &ops) == 2) {
        // Write your code here for circular buffer simulation
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

🔒 Login to Unlock