Microsoft PowerPoint provides different types of tools to make presentations presentable and interactive for different purposes like for business, for class, for projects, etc. Layout… Read More
Tag Archives: Algo-Geek 2021
Cache-oblivious kd-tree data structures are a great utility that performs multi-dimensional orthogonal range searching. One of the salient terms of kd trees is binary space… Read More
Given a matrix grid[][] of size M * N where each cell of the matrix denotes the cost to be present on that cell. The… Read More
Given an array arr[] of length N, the task is to remove the minimum number of elements from the array to make it a mountain… Read More
Given string s denoting a number. The task is to find the minimum number that can be formed after replacing two consecutive digits of s… Read More
Given an array arr[] containing N positive integers, the task is to minimize the total count of peaks (elements having greater value than both the… Read More
Given an array arr[] of size N and an integer K, one can move from an index i to any other index j such that… Read More
Given an array arr[] of even size N. The task is to count the number of ways of converting arr[] such that the first half… Read More
Given the number D, find the smallest number N such that it has exactly four divisors and the difference between any two of them is… Read More
Two players X and Y are picking up numbers alternatively with X picking first. In the first turn X picks 1, then Y picks 2,… Read More
Given an array arr[] of N integers and an integer K, the task is to calculate the minimum cost by spilling the array elements into… Read More
Given a linked list lis of length N, the task is to determine the maximum distance between two consecutive peaks of the given linked list.… Read More
Given an array arr[] of size N, the task is to find the last remaining element of the array after consecutively removing the 1st and… Read More
Given a square matrix M[][] of size N*N, the task is to reduce that matrix into a matrix of size (N-1) * (N-1) using the… Read More
Given two arrays A[] and B[] of size N each, the task is to minimize A[i] + B[j] such that j ≥ i. Examples: Input:… Read More
Courses
