Jump game – LeetCode Solution [Medium]
You are given an integer array nums. You are initially positioned at the array’s first index, and each element in the array represents your maximum jump length at that position.
Category: Competitive Programming
Find maximum of all subarrays of size k
Given an array of size n and an integer k, we need to find the maximum for each contiguous subarray of size k.
Add Binary numbers in C++ – LeetCode Solution [Easy]
This problem could be solved in O(N) time complexity, where N is the maximum of the given two strings length. We could start traversing the two strings from the last and keep calculating the sum of each string’s character ie ‘0’ and ‘1’. If there’s a carry propagate it to the sum of the next digits in iteration.
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.
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.
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
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.
Number of ways to climb a stair having n steps – LeetCode Solution [Easy]
You are climbing a staircase. It has n steps upto the top. Each time you can either climb 1 step or 2 steps. You’ve to find the number of ways to climb the stair.
Implementing basic Mathematical operations (Euclidean algorithm for GCD)
Given two non-negative integers a and b, you’ve to find the Greatest Common Divisor (GCD) or Highest Common Factor (HCF) of the two numbers. In other words, find the largest number that divides them both. The Euclidean algorithm is one of the oldest numerical algorithms to compute the greatest common divisor (gcd) of two positive integers.