Peek N Bytes from Circular Buffer

Code

#include <stdio.h>

typedef struct {
    int buffer[10];
    int head;
    int tail;
    int count;
    int capacity;
} CircularBuffer;

// Write your logic inside this function
void peek_bytes(CircularBuffer *cb, int n) 
{
    //count: how many number of elements can be printed.
    //n: total number of times the loop should be executing.
  int i;
  for(i=0;i<n;i++)
  {
    if(i<(cb->count)) //In test case 3, we need to traverse 8 times.
    //But count says we can atmost print 6 elements. In such cases to print NULL, this condition is used.
    {
        printf("%d",cb->buffer[cb->tail]);
        cb->tail=(cb->tail+1)%(cb->capacity);
    }
    else 
        printf("NULL");

    if(i!=n-1) //if we are reaching n-1, it means it is last element. After last element we need not print space in " " format.
    {
        printf(" ");
    }
  }
}

int main() 
{
    CircularBuffer cb = {
        .buffer = {10, 20, 30, 40, 50, 60, 70, 80, 90, 100},
        .head = 3,
        .tail = 7,
        .count = 6,
        .capacity = 10
    };

    int n;
    scanf("%d", &n);

    peek_bytes(&cb, n);

    return 0;
}

Solving Approach