Deque Challenge

Medium Deque PRO

🔒 Login to Unlock

Problem Statement

Write a C program to verify if elements inside a deque maintain sorted order (print 1 if sorted ascending, 0 otherwise).

Input Format

Capacity and n elements inserted into the deque.

Output Format

Print 1 if sorted, else 0.

Constraints

1 <= n <= capacity <= 50

Sample Input

5 4
10 20 30 40

Sample Output

Explanation

Traverse the deque from front to rear and check if every element is less than or equal to the next element.

Starter Code

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

int main() {
    int cap, n;
    if (scanf("%d %d", &cap, &n) == 2) {
        // Write your code here for deque challenge sorted verification
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

🔒 Login to Unlock