## Sum of all numbers in the given range which are divisible by M

Given three numbers A, B and M such that A < B, the task is to find the sum of numbers divisible by M in… Read More »

- Find a pair (n,r) in an integer array such that value of nPr is maximum
- Color all boxes in line such that every M consecutive boxes are unique
- Minimize the cost of partitioning an array into K groups
- Count total number of even sum sequences
- Find a pair (n,r) in an integer array such that value of nCr is maximum
- Check whether N is a Factorion or not
- Convert N to M with given operations using dynamic programming
- Check if two given Circles are Orthogonal or not
- Sum of numbers in a range [L, R] whose count of divisors is prime
- Count number of binary strings such that there is no substring of length greater than or equal to 3 with all 1's
- Count of N-digit numbers in base K with no two consecutive zeroes
- Printing the Triangle Pattern using last term N
- Reduce N to 1 with minimum number of given operations
- Check if it is possible to move from (0, 0) to (X, Y) in exactly K steps
- Number of words that can be made using exactly P consonants and Q vowels from the given string
- Find the possible permutation of the bits of N
- Find the sum of prime numbers in the Kth array
- Kth number from the set of multiples of numbers A, B and C
- Count number of Special Set
- Sum of values of all possible non-empty subsets of the given array
- Find the next fibonacci number
- Find numbers which are multiples of first array and factors of second array
- Find the minimum value of X for an expression
- Minimum value to be assigned to the elements so that sum becomes greater than initial sum
- Count the pairs in an array such that the difference between them and their indices is equal
- Count of elements on the left which are divisible by current element
- Find the previous fibonacci number
- Find next greater element with no consecutive 1 in it's binary representation
- Sum of the count of number of adjacent squares in an M X N grid
- Maximum count of common divisors of A and B such that all are co-primes to one another

Given three numbers A, B and M such that A < B, the task is to find the sum of numbers divisible by M in… Read More »

Given Q queries containing ranges in the form of [L, R], the task is to find the sum of all non-fibonacci numbers for each range… Read More »

Given an integer R which denotes the radius of a circle, the task is to find the area of an equilateral triangle inscribed in this… Read More »

Given an integer X which is a perfect square, the task is to find the square root of it by using long division method. Examples:… Read More »

Given two arrays A[] and B[] of length N, the task is to find the minimum number of operations in which the array A can… Read More »

Given an array arr[], the task is to count the number of consecutive Fibonacci pairs in this array. Examples: Input: arr[] = { 3, 5,… Read More »

Given an array of points points[] in a cartesian coordinate system, the task is to find the count of the squares that are parallel to… Read More »

Given an integer array arr[] of size N and a positive integer K, the task is to count all the distinct pairs in the array… Read More »

Given an array arr[] containing N points and a reference point P, the task is to sort these points according to it’s distance from the… Read More »

Dixon’s Factorization method is an integer factorization algorithm. In this article, this method is explained to find the factors of a composite number. Dixon Factorization… Read More »

Given two integers N and K, the task is to find any K distinct odd integers such that their sum is equal to N. If… Read More »

Given an array arr[] of N integers, the task is to find the longest subarray where all numbers in that subarray are prime. Examples: Input:… Read More »

Given a range of values [L, R] and a value K, the task is to count the numbers in the given range which are divisible… Read More »

Given an array arr[][] consisting of Q queries where every row consists of two numbers L and R which denotes the range [L, R]; the… Read More »

Given a number N, the task is to create an array arr[] of size N, where the value of the element at every index i… Read More »