In this tutorial we will learn about stl unordered multimap container in C++. Unordered multimap is an associative container. Same as unordered map it stores key and value pair. But unordered map doesn’t allow duplicate values. Here duplicate values are allowed. Since these are unordered containers, there is no order in the way of storing… Read More »
In this article you will learn about stl algorithm library in c++. Are you a competitive programmer or very passionate programmer then you must know about STL algorithm library. It contains very rich set of algorithms. If you practice this well you can nail any programming interview. All inbuilt algorithms implemented in this library were implemented… Read More »
In this tutorial you will learn about STL Unordered Multiset container in c++ and all functions applicable on it. As name says that, this is an unordered container. Set, unordered_set, multiset has some restrictions to store the elements. But here in unordered_multiset, the features are: 1) Elements need not follow specific order. They follow any… Read More »
In this tutorial you will learn about stl unordered map container i.e. std::unordered_map and all functions applicable on it. By its name we can say that it comes under Associative containers with Unordered property. We know that any unordered container internally implemented with hash tables. So same has hashing concept in worst case any operation… Read More »
In this tutorial you will learn about stl unordered set container in c++ and various functions applicable on it. Unordered Set comes under unordered containers. As we discussed in introduction to stl article, unordered containers internally implemented with hash tables. Each item calculated by hash function, to map to hash table. The main advantage is… Read More »
In this tutorial you will learn about stl multimap i.e., std::multimap and all functions applicable on it with some example code. In previous articles we already learned about std::map container. It is an associative container which give priority to key values. But problem with map is it won’t allow duplicate values. But multimap allows duplicate… Read More »
In this tutorial you will learn about STL Multiset container in C++ i.e. std::multiset and all functions applicable on it. Multiset is an associative container. Same like set this also follows some specific order to store elements. But only difference is these multisets allow duplicate values. And some more similarity to sets to multisets are… Read More »
In this tutorial you will learn about STL priority queue in C++ i.e std::priority_queue and all functions applicable on it. std:: priority_queue is a container adaptor. This is almost same as queue container adaptor. i.e this also works as first in first out (FIFO). Elements always inserted at front position and deletion also done from front… Read More »
