# Category Archives: Mathematical

Given a positive integer N. In one operation subtract N with its highest divisor other than N and 1. The task is to find minimum… Read More
Given two positive integers A and B. The task is to minimize operations required to reduce A and B to 1. There are two types… Read More
Given an array arr[] consisting of N integers, the task is to find the maximum count of integers that are binary searchable in the given… Read More
Given a positive integer N, the task is to find the maximum set of numbers from the first N natural numbers whose Bitwise AND is… Read More
Number System is a method of representing numbers on the number line with the help of a set of symbols and rules. These symbols range… Read More
Given an array arr[] of size N and an integer X, the task is to find the length of the longest subsequence such that the… Read More
Given three integers A, B, and K. The task is to check whether A and B can be reduced to zero by decrementing x and… Read More
Given string str that contains only digits, the task is to return an expression by inserting the ‘+’ or ‘*’ operator between every two digits… Read More
Given a matrix mat[][] of dimensions N*M and an array target[] of M integers, the task is to check whether any row of the matrix… Read More
Given numeric string S of size N and a positive integer K, the task is to find the minimum number of adjacent swaps required in… Read More
Given an array arr[] of N integers and a positive integer K, the task is to find the minimum number of operations required to reduce… Read More
Given a positive integer N, the task is to check if N can be written as the sum of two perfect biquadrates or not i.e., (N… Read More
Given three positive integers X, Y, and B, where X and Y are Base-B integers, the task is to find the value of X –… Read More
Given an array arr[] of N integers, the task is to find the number of pairs of array elements (arr[i], arr[j]) such that the difference… Read More
Given an array arr[] of N integers and an integer D, the task is to find the length of the longest non-decreasing subsequence such that… Read More