## Program to find the Nth Prime Number

Given an integer N. The task is to find the Nth prime number. Examples: Input : 5 Output : 11 Input : 16 Output :… 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 integer N. The task is to find the Nth prime number. Examples: Input : 5 Output : 11 Input : 16 Output :… Read More »

Given an array a[] of size N. The value of a subset is the product of primes in that subset. A non-prime is considered to… Read More »

Given an integer N. The task is to find the sum of the first N prime numbers which don’t contain any odd primes as their… Read More »

Given a string str of lowercase English alphabets, the task is to check whether the string is a vowel prime or not. A string is… Read More »

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 »