C++

What is unordered_map in C++ and How to use it

C++ unordered_map containers are faster than typical map containers. This is attributed to the unordered map being implemented using hash tables. What is unordered_map in...

Deque in C++: The Complete Guide

Deque stands for a double-ended queue. It is pronounced as "deck". It is containers that have dynamic sizes and can be expanded or contracted...

C++ List: How to Add, Assign, Delete List in C++

The list uses non-contiguous memory allocation, so traversal is slower than vector in C++. The list allows insertion and deletion operation anywhere within a sequence...

C++ Multiset: The Complete Guide

Multisets are containers very similar to sets; the main difference in multisets is that they can have multiple elements with the same values, unlike...

C++ Vector: The Complete Guide

C++ Vector is a template class that perfectly replaces suitable old C-style arrays. It allows the same natural syntax used with plain arrays. In...

C++ Set: Standard Template Library(STL)

C++ set containers are slower than the unordered_sets containers when accessing individual elements by their key. Still, the main advantage of sets is that they...