## Sum of element whose prime factors are present in array

Given an array arr[] of non-negative integers where 2 ≤ arr[i] ≤ 106. The task is to find the sum of all those elements from… Read More »

- Program to find the Nth Prime Number
- Check if the given string is vowel prime
- Product of Primes of all Subsets
- Sum of numbers in a range [L, R] whose count of divisors is prime
- Sum of Semi-Prime Numbers less than or equal to N
- Program for Mobius Function | Set 2
- Find the sum of prime numbers in the Kth array
- Find all numbers between range L to R such that sum of digit and sum of square of digit is prime
- Find the XOR of first N Prime Numbers
- Bitwise AND of the sum of prime numbers and the sum of composite numbers in an array
- Sum of prime numbers without odd prime digits
- Absolute difference between the XOR of Non-Prime numbers and Prime numbers of an Array
- Print characters having prime frequencies in order of occurrence
- GCD of elements which occur prime number of times
- Rearrange the given string such that all prime multiple indexes have same character
- Square free semiprimes in a given range using C++ STL
- Queries for the smallest and the largest prime number of given digit

Given an array arr[] of non-negative integers where 2 ≤ arr[i] ≤ 106. The task is to find the sum of all those elements from… 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 two integers N and K, the task is to count all the numbers < N which have equal number of positive divisors as K.… 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 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 two integer and , the task is to find the common prime divisors of these numbers. Examples: Input: A = 6, B = 12… 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 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 »

Given an array A[] of N non-negative integers. Find an Integer greater than 1, such that maximum array elements are divisible by it. In case… 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 »