Deque (Double-Ended Queue)

Easy STL Containers

Solve in Playground →

Problem Statement

Write a C++ program using `std::deque` to push and pop elements from both front and back ends.

Input Format

First line: N. Second line: N space-separated integers.

Output Format

Print deque elements separated by a space.

Constraints

1 <= N <= 1000

Sample Input

4
10 20 30 40

Sample Output

10 20 30 40

Explanation

Deques allow fast insertion and deletion at both the beginning and the end.

Starter Code

#include <iostream>
#include <deque>

int main() {
    int n;
    if (std::cin >> n) {
        std::deque<int> dq;
        for (int i = 0; i < n; i++) {
            int val;
            std::cin >> val;
            dq.push_back(val);
        }
        // Write your deque output logic here

    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →