Author
Swaminathan Iyer
Product @ Interview Kickstart | Ex Media.net | Business Management - XLRI Jamshedpur. Loves building things and burning pizzas!
The Standard Template Library (STL) in C++ is a powerful software library that’s a set of C++ template classes. It provides built-in algorithms, functions, iterators, and containers. This article focuses on the C++ STL container stack.
STL containers are objects that can store multiple elements, manage any storage required for the elements, and offer member functions we can use to access them. A container may allow elements of either the same type or different types to be stored in it. Depending on this, and on whether it is unordered, the containers are divided into three types:
There are also Container Adapters: queue, priority_queue, and stack that are a subset of containers. These container adapters offer a different interface for sequential containers.
To help you harness the power of STL and be a more efficient developer, we’re doing a series on C++ STL container fundamentals. This article focuses on the C++ STL container stack (check out the learn page for more).
Having trained over 10,000 software engineers, we know what it takes to crack the toughest tech interviews. Our alums consistently land offers from FAANG+ companies. The highest ever offer received by an IK alum is a whopping $1.267 Million!
At IK, you get the unique opportunity to learn from expert instructors who are hiring managers and tech leads at Google, Facebook, Apple, and other top Silicon Valley tech companies.
Want to nail your next tech interview? Sign up for our FREE Webinar.
In this article, we’ll cover:
In C++ STL, stack is a container adapter that works with the LIFO (last in first out) arrangement — we add elements at the top and delete them from the top. An encapsulated object of vector or deque or list serves as a stack’s underlying container. Like other containers, stack provides a specific set of member functions to access its elements.
Stacks are used widely for problems involving:
Here are the several methods associated with stack in STL:
Let us now see what some of the most commonly used stack methods do and how to use them in the next section via an example.
Here, we take a look at how you can use a stack as a C++ STL container for a smoother coding experience:
// Stack in STL
#include
#include
using namespace std;
// Print the stack
void printStack(stack stackExample) {
  stack stackToPrint = stackExample;
  // Printing the stack by printing the top element then
  // removing it from the stack till the stack is empty
  while (!stackToPrint.empty()) {
    cout << stackToPrint.top() << " ";
    stackToPrint.pop();
  }
  cout << "n";
}
int main() {
  stack stackExample;
  // Pushing elements into stack
  stackExample.push(9);
  stackExample.push(8);
  stackExample.push(7);
  stackExample.push(6);
  stackExample.push(5);
  stackExample.push(4);
  stackExample.push(3);
  stackExample.push(2);
  stackExample.push(1);
  stackExample.push(0);
  // Printing the stack
  cout << "Contents of stackExample are: ";
  printStack(stackExample);
  // Popping the topmost element of the stack twice OR Popping the two topmost elements of the stack
  stackExample.pop();
  stackExample.pop();
  // Printing the stack after popping the top two elements
  cout << "Contents of stackExample after popping the top two elements: ";
  printStack(stackExample);
  // Printing the size of the stack
  cout << "The size of stackExample is: " << stackExample.size() << endl;
  // Printing the element at the top of the stack
  cout << "The element at the top of stackExample is: " << stackExample.top() << endl;
  stack stackExample2;
  // Checking if the two stacks are empty
  cout << "Is stackExample empty?: " << stackExample.empty() << endl;
  cout << "Is stackExample2 empty?: " << stackExample2.empty() << endl;
  // Swapping stackExample and stackExample2
  stackExample.swap(stackExample2);
  // Checking if the stackExample is empty after the swap with stackExample2
  cout << "Is stackExample empty after the swap with stackExample2?: " << stackExample.empty();
}
Contents of stackExample are: 0 1 2 3 4 5 6 7 8 9
Contents of stackExample after popping the top two elements: 2 3 4 5 6 7 8 9
The size of stackExample is: 8
The element at the top of stackExample is: 2
Is stackExample empty?: 0
Is stackExample2 empty?: 1
Is stackExample empty after the swap with stackExample2?: 1
Check out the learn page for more.
Q1. What is a stack in C++ STL?
Stack in C++ STL is a LIFO (last-in-first-out) container adapter that uses an encapsulated vector/deque/list object as its underlying container. In a stack, we both add and delete elements only from the top of the stack.
Q2. What are stacks in C++ used for?
Stacks are used widely in expression evaluation and parentheses matching, browsers, text editors: undo/redo, memory management, phones, books, clothes, bangles, plates, and temporary storage of information.
Q3. What functions are associated with stack in C++ STL?
Empty, size, top, pop, and push are some functions associated with a stack in C++ STL.
Q4. What type of data structure container is a stack in C++ STL?
Stack in C++ STL provides a LIFO or Last In First Out type of container data structure,
Q5. What is an overflow and underflow condition in a stack?
An overflow condition occurs when you’re trying to push an element, but the stack is full. An underflow condition occurs when you’re trying to pop an element, but the stack is empty.
Whether you’re a coding engineer gunning for a software developer or software engineer role, a tech lead, or you’re targeting management positions at top companies, IK offers courses specifically designed for your needs to help you with your technical interview preparation!
If you’re looking for guidance and help with getting started, sign up for our FREE webinar. As pioneers in the field of technical interview preparation, we have trained thousands of software engineers to crack the most challenging coding interviews and land jobs at their dream companies, such as Google, Facebook, Apple, Netflix, Amazon, and more!
â€
Time Zone:
Get your enrollment process started by registering for a Pre-enrollment Webinar with one of our Founders.
The 11 Neural “Power Patterns” For Solving Any FAANG Interview Problem 12.5X Faster Than 99.8% OF Applicants
The 2 “Magic Questions” That Reveal Whether You’re Good Enough To Receive A Lucrative Big Tech Offer
The “Instant Income Multiplier” That 2-3X’s Your Current Tech Salary
The 11 Neural “Power Patterns” For Solving Any FAANG Interview Problem 12.5X Faster Than 99.8% OF Applicants
The 2 “Magic Questions” That Reveal Whether You’re Good Enough To Receive A Lucrative Big Tech Offer
The “Instant Income Multiplier” That 2-3X’s Your Current Tech Salary
Just drop your name and email so we can send your Power Patterns PDF straight to your inbox. No Spam!
By sharing your contact details, you agree to our privacy policy.
Time Zone: Asia/Dhaka
We’ve sent the Power Patterns PDF to your inbox — it should arrive in the next 30 seconds.
📩 Can’t find it? Check your promotions or spam folder — and mark us as safe so you don’t miss future insights.
We’re hosting a private session where FAANG insiders walk through how they actually use these Power Patterns to crack interviews — and what sets top performers apart.
🎯 If you liked the PDF, you’ll love what we’re sharing next.
Time Zone:
