Skip to content
SDE SHEET - A Complete Guide for SDE Preparation
What is SDE Sheet?SDE Sheet is a list of the most important topics or the most popular questions that are asked in the Software Development Engineer Interviews.How is this...Read More
Pair is used to combine together two values that may be of different data types. Pair provides a way to store two heterogeneous objects as… Read More
Click here for Set 1 of Vectors.   Modifiers 1.1 assign(input_iterator first, input_iterator last) – Assigns new content to vector and resize 1.2 assign(size_type n,… Read More
Double-ended queues are sequence containers with the feature of expansion and contraction on both ends. They are similar to vectors, but are more efficient in case… Read More
Queues are a type of container adaptors that operate in a first in first out (FIFO) type of arrangement. Elements are inserted at the back… Read More
A C++ priority queue is a type of container adapter, specifically designed such that the first element of the queue is either the greatest or… Read More
Stacks are a type of container adaptors with LIFO(Last In First Out) type of working, where a new element is added at one end (top)… Read More
Lists are sequence containers that allow non-contiguous memory allocation. As compared to the vector, the list has slow traversal, but once a position has been… Read More
Vectors are the same as dynamic arrays with the ability to resize itself automatically when an element is inserted or deleted, with their storage being… Read More
Sets are a type of associative container in which each element has to be unique because the value of the element identifies it. The values… Read More
Multisets are a type of associative containers similar to the set, with the exception that multiple elements can have the same values. Some Basic Functions… Read More
Maps are associative containers that store elements in a mapped fashion. Each element has a key value and a mapped value. No two mapped values… Read More
Multimap is similar to a map with the addition that multiple elements can have the same keys. Also, it is NOT required that the key-value… Read More
Sorting is one of the most basic functions applied to data. It means arranging the data in a particular fashion, which can be increasing or… Read More
Binary search is a widely used searching algorithm that requires the array to be sorted before search is applied. The main idea behind this algorithm… Read More
The Standard Template Library (STL) is a set of C++ template classes to provide common programming data structures and functions such as lists, stacks, arrays,… Read More