All submissions

Code

#include <stdio.h>

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

void read_bytes(CircularBuffer *cb, int n) {
    // Your logic here
    int iteration = n;
    while ((iteration != 0) && (cb->head != cb->tail)) {

        printf("%d", cb->buffer[cb->tail]); // Print data from buffer
        cb->tail = (cb->tail + 1) % cb->capacity; // Increase tail with wrap arround
        cb->count--; //Decrease count after each successful read

        if (iteration > 1) {
            printf(" ");
        }

        iteration--;
    }

    while (iteration > 0) {
        if (iteration == 1)
            printf("NULL");
        else 
            printf("NULL ");
        iteration--;
    }

    printf("\n");

    printf("Tail: %d", cb->tail); // Print Tail value at the end
}

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);
    read_bytes(&cb, n);

    return 0;
}

Solving Approach

 

 

 

Loading...

Input

4

Expected Output

80 90 100 10 Tail: 1