Hi everyone In this tutorial we will talk about Multimap So, What is Multimap actually? Multimap is an associative container of C++ STL that stores data in key–value pairs, just like map. The elements are kept sorted by key automatically. The one big difference from map is that multimap allows duplicate keys. The same key […]
Hi everyone In this tutorial we will talk about Unordered Map So, What is Unordered Map actually? Unordered Map is an associative container of C++ STL that stores data in key–value pairs, just like map. Each key inside an unordered map is unique, and we access values using their keys. The big difference from map
Hi everyone In this tutorial we will talk about Map So, What is Map actually? Map is an associative container of C++ STL that stores data in key–value pairs. Each key inside a map is unique, and the elements are always kept sorted by key automatically. Unlike vector or list, where we access elements by
Hi everyone In this tutorial we will talk about Pair So, What is Pair actually? Pair is a simple container that stores two values (which may be of different data types) together as a single unit. The two values are stored side by side and can be accessed individually using .first and .second. Pair is
Hi everyone In this tutorial we will talk about Priority Queue So, What is Priority Queue actually? Priority Queue is a special type of queue where each element has a priority associated with it. Elements with higher priority are served before elements with lower priority, regardless of their insertion order. STL Priority Queue also works
Hi everyone In this tutorial we will talk about Deque So, What is Deque actually? Deque stands for Double Ended Queue. Deque is a special type of queue where data can be inserted and removed at both ends. Header File Inclusion for deque #include <deque> Declaration & Initialization Declaring an empty deque — deque
Hi everyone In this tutorial we will talk about Queue So, What is Queue actually? Queue is a First In First Out(FIFO) data structure. STL Queue also works the same way STL Queue container’s underlying data structure deque (Double Ended Queue) Header File Inclusion for queue #include <queue> Declaration #include <queue> queue <int> fifoList;
Hi everyone We will be learning about pointers in depth in this series. At first, it may sound a little confusing but trust me once you get a hang of it you will love it. Pointer is the fundamental concept of C/C++ programming but we will only be considering C++ forward on. To understand
Hi everyone If you’re eager to learn Swift programming on your Windows machine, this guide is for you. Follow these steps to set up your system and run Swift code effortlessly. Step 1: Download Swift for Windows Visit the Swift for Windows website at https://swiftforwindows.github.io/ and download the Swift 4.1.3 compiler, which is the officially
Running Swift Code on Windows: A Quick Guide for Beginners Read More »
Hi everyone In this tutorial we will talk about Stack So, What is stack actually? Stack is a Last In First Out(LIFO) data structure. STL Stack also works the same way STL stack container’s underlying data structure deque (Double Ended Queue) Header File Inclusion for stack #include <stack> Declaration #include <stack> stack <int> lifoList;