Skip to content

Category Archives: Mathematical

Given a series . and the value of a. Find the sum of the first n term of the series. Examples: Input: a = 3, n… Read More
Given a number N, the task is to remove the adjacent duplicates of a number N and then sort the digits of the number N… Read More
Given a number N, the task is to convert it into a number in which all distinct digits have the same frequency, by rotating its… Read More
Given an array arr[] consisting of N positive integers. The task is to count the number of different non-empty subsets of arr[] having maximum bitwise… Read More
Given an array arr[] of size N and an integer K., The task is to count the number of subarrays with unique sum with sum… Read More
Given an integer N, the task is to find the count of triplets (a, b, c) such that a <= b <= c and a… Read More
Given two integers N and K, the task is to calculate the minimum number of adjacent swaps of digits required to make the integer N… Read More
Given an array arr[] containing N integers, the task is to calculate the average of the difference between both elements in pairs formed from given… Read More
Given an integer N, the task is to find a sequence of N distinct positive integers such that the Greatest Common Divisor of the sequence… Read More
Given N points on a 2D infinite plane, where each point represents the center of a circle initially having a radius of 0 which expands… Read More
Given an integer N in the range [0, 109], the task is to find the maximum product of two integers that are formed by dividing… Read More
Given a number N, the task is to count the combinations of K numbers from 1 to N having a sum equal to N, with… Read More
Given two arrays arr1[] and arr2[] having N integers in non-decreasing order, the task is to find the count of non-decreasing arrays arr3[] of length… Read More
Given an array arr[] containing N integers and an integer K, the task is to find the maximum value of the product of Bitwise AND… Read More
Given two arrays a[] and b[] of length N and M respectively, sorted in non-decreasing order. The task is to find the number of pairs… Read More