C++ Resources

When you compare signed and unsigned integers, you may not get the result you expect. Thanks to the six std::cmp_* functions, there is a cure in C++20.

A list of free Udemy and Couresra courses to learn C++ online

TL;DR
To provide the chance to handle the request by more than one object/component.

CppCon 2020 Trip Report from https://twitter.com/shafikyaghmour

Learning a programming language is common but very few know where the language is used. What is its application? College or School only teaches us…

If you want to learn C++ and looking for the best and free online courses then you can check this article, it contains some of the best and free online courses to learn C++ programming from scratch.

Guidelines for efficiently and safely processing immutable text in C++ using std::string_view. Presents a total of 21 guidelines grouped into five categories such as using std::string_view as an alternative to std::string and using std::string_view as a wrapper to character arrays.

To treat individual & group of objects in a uniform manner.

Official website of Taskflow: A General-purpose Parallel and Heterogeneous Task Programming System

More reasons to use std::map with Modern C++.

C++ - Queue Tutorial

C++ - Unordered Map Tutorial

C++ STL - Deque tutorial.

Brief on C++ Template: Types, Category, Arguments, Specialization(full, partial, non-type, nested), New rules/liberation added from C++11/14/17/20 & Use-cases.

Implementation of Doubly Linked List in C++

TL;DR: Do not use the concrete object directly unless you have a strong reason to do so. Use abstraction instead.

A priority queue is a dynamic data structure that holds priority. It is similar to a heap, where elements can be inserted in any order and max heap element is retrieved first. Similarly, max heap element is deleted first.

Learn about C++ STL - Forward List

A linked list is a linear data structure, in which the elements are stored in the form of a node. Each node contains two sub-elements. A data part that stores the value of the element and next part that stores the pointer to the next node.