How to find the intersection point of two linked lists?
Given the head pointers (head1 and head2) of two linked lists, find the intersection node of the two lists.
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++ 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.
Rat in the maze | Minimum number of steps
Given a maze with obstacles, find the minimum number of steps the rat needs to take to reach the destination.
Print Binary tree in vertical order
Given a Binary tree, print it in vertical order from left to right.
We could solve this problem by performing a breadth-first or level order traversal on the given tree.
Rat in the maze
Given a NxN matrix with 0s and 1s. A block with value 1 can be used to travel ahead in the matrix. Now, consider mat[0][0] as the starting point for the rat.
Heap Data structure | Heap Sort in C++
The Heapsort algorithm uses Heap data structure to sort an array in O(nlogn) time complexity. It starts by calling Build-Max-Heap.
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.
Sorting in Linear Time | Counting Sort, Radix Sort, Bucket Sort
Traditional sorting algorithms have average time complexities of O(n logn), making them efficient for general-purpose sorting.
Fibonacci Numbers in O(logn) [Matrix Exponentiation]
Matrix multiplication can be performed in O(logn) by using matrix exponentiation. It is one of the most used techniques