Delete Rear

Medium Deque PRO

🔒 Login to Unlock

Problem Statement

Write a C program to insert elements into a deque, delete an element from the rear, and print remaining elements.

Input Format

First line: capacity, n insertions at rear. Second line: n elements. Third line: number of deletions from rear.

Output Format

Print remaining deque elements from front to rear separated by spaces.

Constraints

1 <= deletions < n <= capacity <= 50

Sample Input

5 4
10 20 30 40
1

Sample Output

10 20 30

Explanation

Decrement rear pointer circularly when deleting an element from the rear.

Starter Code

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

int main() {
    int cap, n;
    if (scanf("%d %d", &cap, &n) == 2) {
        // Write your code here to delete from rear of deque
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

🔒 Login to Unlock