Tag Archives: Algo-Geek 2021

Given 3 positive integers A, B, and C. Choose a positive integer M and multiply any one of A, B, or C with M. The… Read More
Given an array arr[] of size N. The task is to count the number of unique subsets.  Examples: Input: arr[] = {1, 2, 2}Output: 6Explanation:… Read More
Given an array arr[] of size N. The task is to maximize the minimum value of the array after performing given operations. In an operation,… Read More
Given an NxN square matrix M[][]. The task is to check whether the matrix M is a zero division matrix or not. A matrix is… Read More
Given a matrix arr[][] of size M*N containing only positive integers, the task is to check if every row contains all the integers from 1… Read More
Given a binary matrix of size M*N containing only 0 and 1. The task is to count the number of mappings in the matrix. There… Read More
Given a string S of length N and a positive integer K, the task is to find the minimum total cost of picking K unique… Read More
Given a string str of length N. The task is to print the frequency of adjacent repeating characters.  Examples: Input: str = “Hello”Output: l: 2Explanation:… Read More
Given a rectangle [(x1, y1), (x2, y2)] denoting the coordinates of bottom-left corner and top-right corner whose sides are parallel to coordinates axes and N… Read More
Given an array arr[] of size N and an integer representing an index K, the task is to find the minimum number of operations in… Read More
Given an array arr[] of N integers where ith element represents the amount of water required by the plant at ith index and an integer… Read More
Given an array arr[] of N integer pairs and an integer K, the task is to find the indices of the K largest pairs in… Read More
Given three values, N, L and R, the task is to calculate the sum of binomial coefficients (nCr) for all values of r from L… Read More
Given an array arr[] of length N, the task is to replace all subarrays of only even elements by their length if the length is… Read More
Given two integers A and B, the task is to count the possible values of K such that A%K = B%K. If the count is… Read More