Skip to content

Tag Archives: STL

A Queue is a linear structure that follows a particular order in which the operations are performed. The order is First In First Out (FIFO).… Read More
Given an array A[] of N integers, the task is to find the minimum number of operations to sort the array in non-decreasing order, by… Read More
Deque or Double-ended queues are sequence containers with the feature of expansion and contraction on both ends. They are similar to vectors, but are more… Read More
Deque or Double-ended queues are sequence containers with the feature of expansion and contraction on both ends. They are similar to vectors, but are more… Read More
Deque or Double-ended queue are sequence containers with the feature of expansion and contraction on both ends. They are similar to vectors, but are more… Read More
As we all are using STL quite heavily in our programs in Interviews, Coding Contests. So knowing the Time complexity of the most frequently used… Read More
Given an array arr[] of integers of size N that might contain duplicates, the task is to find all possible unique subsets, using C++ STL.… Read More
Ordered Set contains UNIQUE elements in sorted order just like set. While dealing with an ordered set with duplicate elements, the pair<int, int> data type… Read More
Map is an associative container available in the C++ Standard Template Library(STL) that is used to store key-value pairs. Let’s see the different ways to… Read More
An unordered_set is an associated container available in the C++ Standard Template Library(STL) that is used for unique elements without any specific ordering, it internally… Read More
unordered_map is an associated container available in the C++ Standard Template Library(STL) that is used to store key-value pairs. It internally uses the working principle… Read More
A set is an associative container available in the C++ Standard Template Library(STL) that is used for unique elements in a specific order, it internally… Read More
Prerequisites: Random-access Iterators, Bidirectional Iterators Sets are a type of associative container in which each element has to be unique because the value of the… Read More
What is deque? In C++, a deque is a sequence container and it is also known by the name, double-ended queue. As the name implies,… Read More
What is a multimap? In C++, a multimap is an associative container that is used to store elements in a mapped fashion. Internally, a multimap… Read More

Start Your Coding Journey Now!