Code360 powered by Coding Ninjas X Code360 powered by Coding Ninjas X
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++
Functors EASY
This article discusses the topic of functors.
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.
Sort a Vector in CPP EASY
In this article, we will learn how to sort a vector in C++ using different techniques with proper codes to understand the concept better.
Vector Size in CPP MEDIUM
In this article, we will learn about different ways to find the size of a vector in C++, along with code examples & explanations with their respective time & space complexity.
map.find in C++ EASY
This article will explain the map.find() function in detail, covering its syntax, parameters, return value, time complexity, & a code example.
Iterators & Auto Keyword
This blog will discuss iterators in the C++ programming language. We will also overview the concept of auto keyword in C++.
Algorithms In C++ STL EASY
In this blog, we will learn about Algorithms in C++ STL with the help of various examples.
Graph Implementation using STL MEDIUM
In this blog, we will discuss Graph Implementation using STL with all the crucial aspects necessary to implement it.
Binary Search in C++ Standard Template Library (STL) MEDIUM
Binary search, a highly efficient algorithm, demands prior sorting of the array for optimal performance.

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)
Vectors vs Arrays EASY
This article extensively discusses the differences between arrays and vectors in various aspects.
Different Ways to Reverse a Vector EASY
This article talks about different ways to reverse a vector.
Different ways to initialize a vector EASY
This article focuses on the initialization of vectors in C++
emplace_back() vs push_back() in C++ Vectors EASY
This article focuses on push_back() and emplace_back()
Methods to copy in Vector EASY
This article incorporates the methods to copy in Vector.
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++.
Internal implementation of std::sort() EASY
This article discusses Internal implementation of std::sort(), introsort and its implementation.
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.
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.
Implement min heap in C++ EASY
In this blog, we will learn about the implementation of min heap in C++.
Design Twitter
In this blog, we will discuss an exciting OOPs problem, namely Design Twitter. We will design our simplified version of Twitter.