## Sum of Semi-Prime Numbers less than or equal to N

Given an integer N, the task is to find the sum of semi-prime numbers which are less than or equal to N. A Semi prime… Read More »

- Generate elements of the array following given conditions
- Check if each element of the given array is the product of exactly K prime numbers
- Maximize the size of array by deleting exactly k sub-arrays to make array prime
- Sum of all odd factors of numbers in the range [l, r]
- Smallest Special Prime which is greater than or equal to a given number
- Find maximum operations to reduce N to 1
- Largest number not greater than N which can become prime after rearranging its digits
- Sum of all even factors of numbers in the range [l, r]
- Sum of Semi-Prime Numbers less than or equal to N
- Count primes that can be expressed as sum of two consecutive primes and 1
- Count the number of primes in the prefix sum array of the given array
- Sum of multiplication of triplet of divisors of a number
- Find prime number K in an array such that (A[i] % K) is maximum
- Count of distinct sums that can be obtained by adding prime numbers from given arrays
- Check whether N is a Dihedral Prime Number or not
- Check for an array element that is co-prime with all others
- Find the sum of all Truncatable primes below N
- Queries for the difference between the count of composite and prime numbers in a given range
- Rearrange the given string such that all prime multiple indexes have same character
- Composite numbers with digit sum 1

Given an integer N, the task is to find the sum of semi-prime numbers which are less than or equal to N. A Semi prime… Read More »

Given a string str of size N. The task is to find out whether it is possible to rearrange characters in string str so that… Read More »

Given an integer N, for every integer i in the range 2 to N, assign a positive integer such that the following conditions hold :… Read More »

Given Q queries where each query consists of two positive integers L and R and the task is to find the absolute difference between the… Read More »

Given an array of numbers and the value of , check if each number can be expressed as the product of exactly prime numbers. For… Read More »

Given an array arr[] of N positive integers and a non negative integer K. The task is to delete exactly K sub-arrays from the array… Read More »

Given an array arr[] of N integers, the task is to count the number of primes in the prefix sum array of the given array.… Read More »

Given an array arr[] of n integers. The task is to find an element from the array K such that K is prime. And, arr[i]… Read More »

Given a number N, the task is to find the largest number less than or equal to the given number N such that on rearranging… Read More »

Given an integer N, the task is to check if N is a Dihedral prime number or not. A Dihedral prime is a prime number… Read More »

Given an array arr[] of integers of size n. For each element, you have to print the summation of multiplication of every triplet formed using… Read More »

Given two arrays arr1[] and arr2[]. The task is to count the distinct sums that can be obtained while choosing a prime element from arr1[]… Read More »

Given an integer N, the task is to find the sum of all Truncatable primes below N. Truncatable prime is a number which is left-truncatable… Read More »

Given a range [l, r], the task is to find the sum of all the even factors of the numbers from the given range. Examples:… Read More »

Given a range [l, r], the task is to find the sum of all the odd factors of the numbers from the given range. Examples:… Read More »