All submissions

Peek N Bytes from Circular Buffer

Code

#include <stdio.h>
/*
Peeking N bytes

Condition:
If n is greater than the number of available bytes (count), 
print "NULL" for each extra byte.

Plan:
- Start from the current tail: This is the index of the first byte to peek
- For each byte to peek (i=0 to n-1)
- If i < cb->count
    - calculate the index: (cb->tail + i) % cb->capacity
    - print the value at the index: cb->buffer[index]
- Else 
    - print NULL
- print all values on one line, separated by spaces

*/
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) {
    // Your code here
    int currentTail = cb->tail;
    for(int i = 0; i < n; ++i)
    {
        if(i < cb->count)
        {
            int indexToPrint = (cb->tail + i) % cb->capacity;
            printf("%d", cb->buffer[indexToPrint]);
        }
        else
        {
            printf("NULL");
        }

        if(i != n-1) 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

 

 

 

Loading...

Input

4

Expected Output

80 90 100 10