## Count subarrays with Prime sum

Given an array A[] of integers. The task is to count total subarrays whose sum is prime with ( size > 1 ). Examples: Input… 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
- Find Largest Special Prime which is less than or equal to a given number
- 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
- 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
- Maximum GCD of N integers with given product
- Minimum absolute difference of a number and its closest prime
- Count pairs in an array such that at least one element is prime
- Maximum no. of contiguous Prime Numbers in an array

Given an array A[] of integers. The task is to count total subarrays whose sum is prime with ( size > 1 ). Examples: Input… Read More »

Given a string containing only lowercase english alphabets. The task is to find the bitwise XOR of all the prime frequencies of the characters in… Read More »

Given an integer k and an array of integers arr, the task is to find the sum and product of k smallest and k largest… Read More »

Given an integer k and an array of integers arr (less than 10^6), the task is to find the sum of every k’th prime number… Read More »

Given an integer . The task is to find the superpower from the factorization of . The Superpower is the highest power among the power… Read More »

Given an array arr[] of N positive integers. The task is to find the sum of all composite elements which are divisible by a given… Read More »

Given a singly linked list containing N nodes, the task is to find the total count of prime numbers. Examples: Input: List = 15 ->… Read More »

Given an array of integers. The task is to calculate the product of all the composite numbers in an array. Note: 1 is neither prime… Read More »

Given two numbers and as interval range, the task is to find the prime numbers in between this interval. Examples: Input : a = 1,… Read More »

Given an array ‘arr’ of positive integers, the task is to count the number of composite numbers in the array. Note: 1 is neither Prime… Read More »

Given an integer ‘n’, the task is to check whether the sum of digits at the odd positions (from right to left) is prime or… Read More »

Given an array of integers arr[]. The task is to find the bitwise XOR of all the prime numbers present in the array. Examples: Input:… Read More »

Given an integer ‘k’ and an array of integers ‘arr’ (less than 10^6), the task is to find the product of every K’th prime number… Read More »

Given a string. The task is to find the count of characters whose number of occurrences is prime. Examples: Input : str = “geeksforgeeks” Output… Read More »

Given an positive integer N, calculate the product of the first N prime numbers. Examples: Input : N = 3 Output : 30 Explanation :… Read More »