## Count Distinct Rectangles in N*N Chessboard

Given a N x N Chessboard. The task is to count distinct rectangles from the chessboard. For example, if the input is 8 then the… Read More »

- Make all numbers of an array equal
- Count rotations of N which are Odd and Even
- New Algorithm to Generate Prime Numbers from 1 to Nth Number
- Number of array elements derivable from D after performing certain operations
- Minimum multiplications with {2, 3, 7} to make two numbers equal
- Largest number N which can be reduced to 0 in K steps
- Length of the longest increasing subsequence such that no two adjacent elements are coprime
- Count Odd and Even numbers in a range from L to R
- Check if each element of the given array is the product of exactly K prime numbers
- Smallest and Largest Palindrome with N Digits
- Check whether a number is Non-hypotenuse number
- Closest sum partition (into two subsets) of numbers from 1 to n
- Predict the winner in Coin Game
- Number of trailing zeroes in base B representation of N!
- Check if N is Strong Prime
- Check if factorial of N is divisible by the sum of squares of first N natural numbers
- Count of Numbers such that difference between the number and sum of its digits not less than L
- Find maximum operations to reduce N to 1
- Find last five digits of a given five digit number raised to power five
- Find nth Hermite number
- Count number of trailing zeros in Binary representation of a number using Bitset
- Addition of two numbers without propagating Carry
- Find the maximum number of composite summands of a number
- Split the array into odd number of segments of odd lengths
- Sum of all perfect numbers present in an array
- Count of numbers from range [L, R] whose sum of digits is Y
- Numbers of Length N having digits A and B and whose sum of digits contain only digits A and B
- Count of all N digit numbers such that num + Rev(num) = 10^N - 1
- Numbers less than N that are perfect cubes and the sum of their digits reduced to a single digit is 1
- Count primes that can be expressed as sum of two consecutive primes and 1

Given a N x N Chessboard. The task is to count distinct rectangles from the chessboard. For example, if the input is 8 then the… Read More »

Given an array arr[] containing N positive integer. The task is to find the sum of all the perfect numbers from the array. A number… Read More »

Given an array of numbers and the value of , check if each number can be expressed as the product of exactly prime numbers. For… Read More »

Apart from Sieve of Eratosthenes method to generate Prime numbers, we can implement a new Algorithm for generating prime numbers from 1 to N. It… Read More »

There are two players P1 and P2 and two piles of coins consisting of M and N coins respectively. At each turn, a player can… Read More »

Given a number X and an array of N numbers. The task is to print all the numbers in the array whose set of prime… Read More »

Given a 3-digit number N, the task is to find if N is an Osiris number or not. Osiris numbers are the numbers that are… Read More »

Given an integer n, the task is to check if n is a Dudeney number or not. A Dudeney number is a positive integer that… Read More »

Given an integer N, the task is to check if N is a Dihedral prime number or not. A Dihedral prime is a prime number… Read More »

Given an integer N. The task is to find the number of integers 1 < x < N, for which x and x + 1… Read More »

Given three integer n, m and k. Find the element at kth position after repeating the given operation n number of times. In a single… Read More »

Given an array arr[] of size N. The task is to find the length of the longest subsequence from the given array such that the… Read More »

Given an array arr[] of integers of size n. For each element, you have to print the summation of multiplication of every triplet formed using… Read More »

Given an integer N, the task is to find whether fact(N) is divisible by sum(N) where fact(N) is the factorial of N and sum(N) =… Read More »

Given an integer N(1<=N<=10^9). The task is to represent N as a sum of the maximum possible number of composite summands and print this maximum… Read More »