Circular Buffer with Pointers | Dataford Interview Questions

Write a program to implement a circular buffer using pointers.

Implement circular_buffer(capacity, operations) using a fixed-size array and integer read and write pointers. Each operation is an array such as ["enqueue", value], ["dequeue"], or ["peek"]; return one result per operation, using True or False for enqueue success and None when dequeue or peek cannot return a value.

The buffer must reuse positions after wraparound and reject enqueue operations when full.

Constraints

1 <= capacity <= 10^4
1 <= operations.length <= 10^4
Each enqueued value is an integer
Operation names are exactly "enqueue", "dequeue", or "peek"
The buffer must not grow beyond capacity

Function Signature

def circular_buffer(capacity, operations):

Your question is Circular Buffer with Pointers. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Write a program to implement a circular buffer using pointers.

The buffer must reuse positions after wraparound and reject enqueue operations when full.

Constraints

1 <= capacity <= 10^4
1 <= operations.length <= 10^4
Each enqueued value is an integer
Operation names are exactly "enqueue", "dequeue", or "peek"
The buffer must not grow beyond capacity

Function Signature

def circular_buffer(capacity, operations):

Your question is Circular Buffer with Pointers. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.