New update is available. Click here to update.

Last updated: Feb 22, 2022

STL in C++

STL is an acronym for Standard Template Library. It is a set of C++ template classes that provide generic classes and functions that can be used to implement data structures. It is a library of container classes, algorithms, and iterators.

Exploring the STL libraries in C++

0 upvotes

This article discusses the topic of functors.

Author Shreya Deep

0 upvotes

Iterators in c++ EASY

In this blog, we will learn about the Iterators, the operators in iterators, and their types. And at the end of the blog, we will also get to know the pros and cons of iterators.

Author Shivani Kumari

0 upvotes

Iterators & Auto Keyword

This blog will discuss iterators in the C++ programming language. We will also overview the concept of auto keyword in C++.

Author Aman kumar Chourasiya

0 upvotes

Algorithms In C++ STL EASY

In this blog, we will learn about Algorithms in C++ STL with the help of various examples.

Author Akash Nagpal

1 upvote

Graph Implementation using STL MEDIUM

In this blog, we will discuss Graph Implementation using STL with all the crucial aspects necessary to implement it.

Author Nilesh Kumar

0 upvotes

Binary Search in C++ Standard Template Library (STL) MEDIUM

In this blog, we will discuss binary search in c++ using the standard template library(STL), and also look at the normal code as well as implementation using standard template library for better understanding.

Author Vaibhav Agarwal

0 upvotes

Containers

A container is a holder object that stores a collection of other objects(its elements).Container owns the elements. It controlled the creation and destruction.We’re going to learn about Sequence containers,Unordered associative containers,Container adaptors and Associative containers.

STL containers in C++

This article describes the STL containers present in the C++ programming language.

Author Shreya Deep

2 upvotes

Containers In C++ STL EASY

In this blog, we will learn about containers in C++ Standard Template Library (STL).

Author Akash Nagpal

0 upvotes

Sequence containers Sequence containers are used for data structures that store objects of the same type in a linear manner.

Container Adaptors Container adapters are a special type of container class. They are not full container classes on their own, but wrappers around other container types such as Vector, Deque, List.

Associative Containers Associative containers is one that stores Sorted Data , in contrast to other Container types. Because of this, it is much faster to search through it and access the data.

Unordered Associative Containers Unordered Associative Containers provide unsorted data structures that can be accessed using a hash.

More About STL Containers

Containers Library in STL gives us the Containers, which can be described as the objects used to contain data or rather a collection of objects. Containers help us to implement and replicate simple and complex data structures very easily like arrays, lists, trees, associative arrays, and many more. Let’s learn more about STL Containers.

Time and space complexity of STL containers EASY

In this blog, we will be studying the Time and space complexity of STL containers (Priority Queue, Map, Set, Stack, Queue, Vector, List)

Author Rhythm Jain

0 upvotes

Vectors vs Arrays EASY

This article extensively discusses the differences between arrays and vectors in various aspects.

Author Vidhi Singh

0 upvotes

Different Ways to Reverse a Vector EASY

This article talks about different ways to reverse a vector.

Author Mohammad Yawar

0 upvotes

Different ways to initialize a vector EASY

This article focuses on the initialization of vectors in C++

Author Mohammad Yawar

0 upvotes

emplace_back() vs push_back() in C++ Vectors EASY

This article focuses on push_back() and emplace_back()

Author Mohammad Yawar

2 upvotes

Methods to copy in Vector EASY

This article incorporates the methods to copy in Vector.

Author Amit Singh

0 upvotes

Difference between Set, Multiset, Unordered_set and Unordered_multiset MEDIUM

This blog will cover the basics of a set, multiset, unordered_set and unordered_multiset and how they differ from each other in C++.

Author Abhishek Nayak

1 upvote

Internal implementation of std::sort() EASY

This article discusses Internal implementation of std::sort(), introsort and its implementation.

Author Rhythm Jain

0 upvotes

std::optional EASY

This blog will discuss std::optional in C++ with its member functions, examples with suitable code implementation along with some frequently asked questions.

Author Aayush Sharma

0 upvotes

Std::stoull and std::stoul in Cpp EASY

In this article, we have discussed the std::stoull and std::stoul functions in C++, where we have seen their application and characteristics with code.

Author Ayush_159a

0 upvotes

Shuffle vs random_shuffle in C++ EASY

This article talks about how to shuffle elements using shuffle and random_shuffle and the difference between them.

Author Mohammad Yawar

0 upvotes

Implement min heap in C++ EASY

In this blog, we will learn about the implementation of min heap in C++.

Author Anant Dhakad

1 upvote

In this blog, we will discuss an exciting OOPs problem, namely Design Twitter. We will design our simplified version of Twitter.

Author Husen Kagdi

1 upvote

Library:

C Programming Language

C++ Programming Language

Cloud Computing

Machine Learning

Operating System

Amazon Web Services

Microsoft Azure

Google Cloud Platform

Data Warehousing

Internet of Things