# Tag Archives: Prime Number

Given an array arr[] of size N,  the task is to count the number of non-empty subsets whose product is equal to P1×P2×P3×……..×Pk  where P1,… Read More
Given a positive integer N and a string S initially it is “A”, the task is to minimize the number of operations required to form… Read More
Given a positive integer N, the task is to find the Nth smallest number in the sequence which is having exactly 4 divisors. Examples: Input:… Read More
Given a number N, the task is to count the number of unique prime numbers that can be formed by deleting zero or more digits… Read More
Given two strings S1 and S2 consisting of N and M characters, the task is to check if the string S1 can be made equal… Read More
Given an integer array A[] of size N, the task is to find the prime numbers just less and just greater than A[i] (for all… Read More
Given an array arr[] consisting of N integers such that each array element arr[i] represent coefficients of a polynomial expression starting with the highest degree(A[0].X(N… Read More
Given two numbers X and Y, the task is to make both of them equal by repeatedly multiplying with their prime factors minimum number of… Read More
Given an integer N, repeatedly choose two distinct integers from the range 2 to N and if their GCD is found to be greater than… Read More
Given a Binary string, the task is to find the largest Prime Number possible by the decimal representation of a subsequence of the given binary… Read More
Given a positive integer N, the task is to calculate the Bitwise XOR of first N numbers which are a product of exactly two distinct… Read More
Given an array arr[] of size N containing strings, the task is to count the number of strings having sum of ASCII values of characters… Read More
Given an array arr[] of size N, the task is to find the index in the given array where the sum of the prime numbers… Read More
Given an array arr[] consisting of N positive integers, the task is to find an index from the array having count of prime numbers present… Read More
Given a positive integer N, the task is to count the number of integers from the range [1, N] having exactly 5 divisors. Examples: Input:… Read More