Implement a ring buffer

Q: Implement a ring buffer

This question evaluates implementation skills for fixed-capacity circular buffers and competency in array-based data structures, including O(1) push/pop/peek/isEmpty/isFull/size operations and logical-order iteration.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Implement a fixed-capacity circular buffer (ring buffer) supporting push, pop, peek, isEmpty, isFull, and size in O(

time using an array. Define and implement the behavior when pushing to a full buffer (either overwrite the oldest element or reject the push—choose and document). Provide iteration over current elements in logical order. Discuss how you would extend it to a thread-safe version with optional blocking push/pop using condition variables, and analyze time/space complexity.

Implement a ring buffer

Overview

Comments (0)