## All pairs whose xor gives unique prime

Given an array arr[], the task is to count all the pairs whose xor gives the unique prime, i.e. no two pairs should give the… Read More »

- Sum of the first N Prime numbers
- Program to find Prime Numbers Between given Interval
- Check if a prime number can be expressed as sum of two Prime Numbers
- Sum of all the prime numbers in a given range
- Delete all Prime Nodes from a Circular Singly Linked List
- Sort only non-prime numbers of an array in increasing order
- Minimum and Maximum prime numbers in an array
- Largest palindromic prime in an array
- Count subarrays with Prime sum
- 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
- Next smallest prime palindrome
- 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
- 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 GCD of N integers with given product
- Maximum no. of contiguous Prime Numbers in an array
- Count pairs in an array such that at least one element is prime
- Minimum absolute difference of a number and its closest prime
- Print numbers such that no two consecutive numbers are co-prime and every three consecutive numbers are co-prime
- Absolute difference between the Product of Non-Prime numbers and Prime numbers of an Array
- Check if a number is Primorial Prime or not

Given an array arr[], the task is to count all the pairs whose xor gives the unique prime, i.e. no two pairs should give the… Read More »

Given an array arr[] of integers, the task is to print the largest palindromic prime from the array. If no element from the array is… Read More »

Given a string str, the task is to check whether the count of vowels in the given string is prime or not. If its prime… Read More »

Given an array arr[], the task is to check whether the sum of primes in the array is divisible by any of the primes in… Read More »

Given a positive integer N, the task is to find the absolute difference of N and the prime number closest to N . Note: The… Read More »

Given a string S. The task is to count and print the number of characters in the string whose ASCII values are prime. Examples: Input:… Read More »

Given an array arr, the task is to find the sum of the elements which have prime frequencies in the array. Note: 1 is neither… Read More »

Given a string str containing only lowercase English alphabets, the task is to find the sum and product of all the prime frequencies of the… Read More »

Given an array of integers. The task is to sort the given array on the basis increasing count of distinct prime factors. Examples: Input :… Read More »

Given an array having N elements. The task is to check if the sum of prime elements of the array is prime or not. Examples:… Read More »

Given a prime number . The task is to check if it is possible to express as sum of two separate prime numbers. Note: The… Read More »

Given a string of lowercase English alphabets. The task is to check if the count of distinct characters in the string is prime or not.… Read More »

Given a string , the task is to check if the frequencies of all the characters of the string are prime or not. If all… Read More »

Given a prime . The task is to count all the primitive roots of . A primitive root is an integer x (1 <= x… Read More »

Given an array containing n distinct numbers. The task is to find the smallest prime which is not present in the array. Note: If there… Read More »