## Sort an array according to the increasing count of distinct Prime Factors

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 »

## Check whether the sum of prime elements of the array is prime or not

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 »

## Check if a prime number can be expressed as sum of two Prime Numbers

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 »

## Check whether the frequencies of all the characters in a string are prime or not

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 »

## Smallest prime number missing in an array

Given an array containing n distinct numbers. The task is to find the smallest prime which is not present in the array. Examples: Input: arr[]… Read More »

## 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 »

## XOR of Prime Frequencies of Characters in a String

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 »

## Sum of every K’th prime number in an array

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 »

## Find the super power of a given Number

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 »

## Sum and Product of all Composite numbers which are divisible by k in an array

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 »

## Count of Prime Nodes of a Singly Linked List

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 »

## Product of all the Composite Numbers in an array

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 »

## Count and Sum of composite elements in an array

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 »

## Sort prime numbers of an array in descending order

Given an array of integers ‘arr’, the task is to sort all the prime numbers from the array in descending order in their relative positions… Read More »

## Count number of integers less than or equal to N which has exactly 9 divisors

Given a number N(1<=N<=109), the task is to find the total number of integers less than equal to n which have exactly 9 divisors. Examples:… Read More »