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.
Author: Logan
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
Fibonacci Numbers Solution (O(1) auxiliary space)
To find the nth fibonacci number, we need not store previous Fibonacci numbers in an array. We could use two temporary variables instead of an array to store previous fibonacci numbers
Common Sorting Algorithms
A sorting algorithm is an algorithm that puts elements of a list into an order. Most frequently we’re required to sort data structures such as arrays, linked lists etc having numerical values. There’re various algorithms to sort a container or a data structure. In this post, we’ll discuss most popular or commonly used algorithms.
Pascal’s Triangle
In mathematics, Pascal’s triangle is a triangular array of the binomial coefficients. It can also be viewed as: each number in Pascal’s triangle is the sum of the two numbers directly above it.
Minimum number of moves to equal array elements – LeetCode Solution [Medium]
Given an integer array nums of size n, return the minimum number of moves required to make all array elements equal. In one move, you can increment n – 1 elements of the array by 1.