C/C++ Archives - Only Code

Different ways to iterate over C++ Vector

A vector is a data structure for maintaining a set of elements having a specific data type.
Here, we’ll learn about various ways to iterate over a C++ Vector. (Some of the following ways could also be used with other C++ containers like list, queue, map etc.)

C/C++

C Revision (Quick Notes)

Importance of main: main() function is the first function to be executed in the program. All the remaining functions in the program are called from main().

C/C++

Custom Comparators in C++

Custom Comparators are used to compare the members or objects of user-defined containers (class/data structure).

C/C++, Competitive Programming, Sorting

Bitmasking

You’ve N elements and you need to find the subsets of these N elements where zero or more of the N elements are included or excluded.

C/C++, Competitive Programming

C++ Standard Template Library (STL) – [Pair and Tuple]

Pair in C++ STL is used to combine two values having different or same data types. It stores two different values as a single element. Tuple unlike pair can be used to combine two or more than two values having different or same data types.

C/C++

map vs unordered_map in C++ Standard Template Library (STL)

Internally, the elements in the unordered_map are not sorted in any particular order with respect to either their key or values (unlike map)

C/C++, Hashmaps

C++ Standard Template Library (STL) – [Stack and Queue]

Stacks and queues are data structures that store elements of a specific data type. They have various operations (methods/functions) to input, output and manage the data.
Stack implements a last-in, first-out (LIFO) policy on its elements.

C/C++, Queues, Stacks

C++ Standard Template Library (STL) – [Heap]

The Heap data structure is an array that can be viewed as a complete Binary Tree. Each node in the tree corresponds to an element of the array A[].
In this post we will learn about, how to build min/max Heaps using STL.

C/C++, Heaps, Special Data Structures

C++ Standard Template Library (STL) – [Vector]

A vector is a data structure for maintaining a set of elements having a specific data type. Vectors can be considered as arrays having dynamic size. Just like arrays, vectors also store its elements in a contiguous storage locations.

C/C++

Find all the occurrences of a substring in a given string in C++

Given a string s1, find the occurrences of string s2 in s1.
Input: s1 = “onlycode”; s2 = “code”

C/C++, Competitive Programming