Given a number N, the task is to check whether N has 7 divisors or not. Examples: Input: 64Output: 1 Explanation: 1, 2, 4, 8, 16,… Read More
Tag Archives: Prime Number
Given a number N, the task is to find the primes within range [1, N] which is also a part of a Tribonacci series starting… Read More
Given an array arr[] having N integers, the task is to find the GCD of all the numbers in the array which are not prime.… Read More
Given an array of integers arr[] of size N and an integer K, the task is to find the smallest prime such that it gives… Read More
Given an array arr[] of size N having only positive elements, the task is to find the number of primes less than the number formed… Read More
Given integers L and R, the task is to find the number of integers in range [L, R] (say X) which does not form a… Read More
Given an integer N, the task is to generate an array of N distinct integers. Such that the GCD of all the elements of the… Read More
Given two positive integers L and R, the task is to find the count of numbers in the range [L, R] which are not divisible… Read More
Given a range [L, R] and an integer K, find all the groups in the given range having at least K consecutive composite integers. … Read More
Given a string S representing an N digit integer, the task is to find the maximum number of digits that can be removed such that… Read More
Given an integer N, the task is to calculate the maximum number of times N can be divided by an integer K, where K is… Read More
Given 1 to N vertices of a non-cyclic undirected graph with (N-1) edges. The task is to assign values to these edges so that the… Read More
Given a 2D matrix arr[] of size N*M, the task is to find the number of rows and columns having all primes. Examples: Input: arr[]=… Read More
Given a positive integer, A. The task is to find two numbers B and C such that their product is A and their GCD should… Read More
Given two integers L and R. The task is to count the prime numbers in the range [L, R], whose single sum is also a… Read More
Courses
