Implement a Ring Buffer

Implementing a fixed-capacity ring buffer in C++

This is a medium-difficulty coding problem that tests your ability to implement a core data structure used in low-latency systems, market data feeds, and embedded applications. Ring buffers are valued for their predictable memory footprint and O(1) operations, making them common in performance-critical codebases.

The challenge lies in managing the circular wraparound logic correctly and disambiguating between full and empty states without wasting capacity. You'll need to track read and write positions carefully, handle boundary conditions when indices wrap, and ensure that your interface matches the specified contract for empty reads and reset semantics.

• Circular index arithmetic and modulo operations
• State management: distinguishing full from empty
• Generic/template design in C++
• FIFO semantics with fixed memory overhead