## Check if is possible to get given sum from a given set of elements

Given array of numbers and a integer x. Find whether it is possible or not to get x by adding elements of given array, we… Read More »

- Sum of the first N Prime numbers
- Check if a prime number can be expressed as sum of two Prime Numbers
- Sum of all the prime numbers in a given range
- Find a number that divides maximum array elements
- Minimum and Maximum prime numbers in an array
- Largest factor of a given number which is a perfect square
- Largest palindromic prime in an array
- Count number of integers less than or equal to N which has exactly 9 divisors
- Count of Prime Nodes of a Singly Linked List
- Find the Product of first N Prime Numbers
- Smallest prime number missing in an array
- Sum of all prime numbers in an Array
- Check if a number is a Trojan Number
- Print all safe primes below N
- Check if the sum of primes is divisible by any prime from the array
- Sum of elements in an array having prime frequency
- Sort prime numbers of an array in descending order
- Number of divisors of product of N numbers
- Sum of element whose prime factors are present in array
- Print prime numbers with prime sum of digits in an array
- Pair of prime numbers with a given sum and minimum absolute difference
- Sum and product of k smallest and k largest prime numbers in the array
- Maximum no. of contiguous Prime Numbers in an array
- Count pairs in an array such that at least one element is prime
- Common prime factors of two numbers
- Check if a number is Primorial Prime or not
- Product of all prime numbers in an Array
- Numbers in range [L, R] such that the count of their divisors is both even and prime
- Smallest Special Prime which is greater than or equal to a given number
- Find maximum operations to reduce N to 1

Given array of numbers and a integer x. Find whether it is possible or not to get x by adding elements of given array, we… Read More »

Given two integers L and R. The task is to find the sum of all prime factors of every number in the range[L-R]. Examples: Input:… Read More »

Given a number N. The task is to find the sum of all the prime divisors of N. Examples: Input: 60 Output: 10 2, 3,… Read More »

Given a number N. The task is to print the nearest prime if the number is not prime by making it prime by adding prime… Read More »

Given an array arr[] of n elements and a number K. The task is to determine if it is possible to reach the end of… Read More »

Generate all prime numbers between two given numbers. The task is to print prime numbers in that range. The Sieve of Eratosthenes is one of… Read More »

Given x, k and m. Compute (xxxx…k)%m, x is in power k times. Given x is always prime and m is greater than x. Examples:… Read More »

Given two numbers M and N. The task is to print the number which has the maximum number of distinct prime factors of numbers in… Read More »

Given a number N, find the number of distinct prime factors for all numbers in the range [1, N]. Examples : Input : N =… Read More »

Given an integer N. Find the minimum number of square free divisors. In other words, the factorization of N should comprise of only those divisors… Read More »

Given an array A containing numbers from 2 to N.. A special type of sieving is done on it . The procedure of sieving is… Read More »

Given two integers ‘L’ and ‘R’, write a program to find the total numbers that are having prime number of set bits in their binary… Read More »

Given Q queries. Each query contain a positive integer n. The task is to output the sum of sum of odd number digit contained in… Read More »

Given a number N, print all prime number smaller than or equal to N in reverse order . For example, if N is 9, the… Read More »

In number theory, an arithmetic number is an integer for which the average of its positive divisors is also an integer. Or in other words,… Read More »