## Check whether the given number is Euclid Number or not

Given a positive integer n, the task is to check if it is Euclid Number or not. Print ‘YES’ if the given number is Euclid… 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
- Product of all primes in the range from L to R
- Find count of Almost Prime numbers from 1 to N
- 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
- Count pairs in an array such that at least one element is prime
- Maximum no. of contiguous Prime Numbers in an array
- 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

Given a positive integer n, the task is to check if it is Euclid Number or not. Print ‘YES’ if the given number is Euclid… Read More »

Given an integer ‘n’, the task is to find the sum of first ‘n’ prime numbers. First few prime numbers are: 2, 3, 5, 7,… Read More »

Given a number N which is prime. The task is to find all the numbers less than or equal to 10^6 whose minimum prime factor… Read More »

Given a range [L, R]. The task is to find the product of all the prime numbers in the given range from L to R… Read More »

Given a number N. Find number of almost primes from 1 to . A number is called almost if it has exactly two distinct prime… Read More »

Given a range [L, R]. The task is to find the sum of all the prime numbers in the given range from L to R… Read More »

Given a m x n matrix of positive integers. The task is to find the number of paths from the top left of the matrix… Read More »

Given a number N (greater than 2 ). The task is to find two distinct prime numbers whose product will be equal to the given… Read More »

Given an array A of integers. We can remove at most one index from the array. Our goal is to maximize the length of the… Read More »

Given an integer N. The task is to find the minimum number of log values needed to calculate all the log values from 1 to… Read More »

Given a number N. The task is to find the sum of all factors of the given number N. Examples: Input : N = 12… Read More »

Given an array arr[] of N positive integers. The task is to write a program to count the number of prime elements in the given… Read More »

Given an array. The task is to count the possible pairs which can be formed using the elements of the array where both of the… Read More »

Given a range [low..high], print the largest twin numbers in given range (low and high inclusive). Two numbers are twins if they are primes and… Read More »

We have to print alternate prime numbers till N. Examples: Input : N = 10 Output : 2 5 Input : N = 15 Output… Read More »