Circular Queue Challenge

Medium Circular Queue PRO

🔒 Login to Unlock

Problem Statement

Write a C program to search for a specific element in a circular queue and return its 0-based relative index from front.

Input Format

Capacity, n elements, and target value to search.

Output Format

Print relative position index, or -1 if not found.

Constraints

1 <= n <= capacity <= 50

Sample Input

5 4
10 20 30 40
30

Sample Output

Explanation

Iterate through the circular buffer elements from front to rear checking for a value match.

Starter Code

#include <stdio.h>
#include <stdlib.h>

int main() {
    int cap, n, target;
    if (scanf("%d %d", &cap, &n) == 2) {
        // Write your code here for circular queue search challenge
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

🔒 Login to Unlock