Deque - Double Ended Queue
C++
Hard
3 views
Problem Description
Add/remove from both front and back.
Real Life: Line where you can join from either end.
Step-by-Step Logic:
1. Create deque
2. push_front() adds to front
3. push_back() adds to back
4. pop_front() removes from front
5. pop_back() removes from back
Official Solution
void stl_q13_deque() {
deque<int> dq;
dq.push_back(20);
dq.push_back(30);
dq.push_front(10);
dq.push_front(5);
cout << "Deque: ";
for(int num : dq) {
cout << num << " ";
}
cout << endl;
dq.pop_front();
dq.pop_back();
cout << "After removing from both ends: ";
for(int num : dq) {
cout << num << " ";
}
cout << endl;
}
Solutions (0)
No solutions submitted yet. Be the first!
No comments yet. Start the discussion!