Given an array A[] of size N, the task for each array element is to count the array elements on their right that are smaller… Read More
Tag Archives: Prime Number
Given an array arr[], the task is to maximize the length of increasing subsequence by replacing elements to greater or smaller prime number to the… Read More
Given an integer N, the task is to check if N is a prime number in Flipped Down, Mirror Flipped and Mirror Flipped Down forms… Read More
Given an array, arr[] of size N, the task is to find the length of the longest increasing prime subsequence possible by performing the following… Read More
Given an array arr[] consisting of N positive integers, the task is to find the length of the longest increasing subsequence consisting of Prime Numbers… Read More
Given an array arr[], the task is to convert it into a non-decreasing array by adding primes to array elements such that the sum of… Read More
Given an integer N, the task is to find the number of prime numbers up to N that can be expressed as a sum of… Read More
In this article, you will see how you can write the logic of stored procedure to generate prime numbers for any given input. Title :… Read More
Given two arrays arr1[] and arr2[] of length N and M respectively, the task is to find the length of the longest common prime subsequence… Read More
Given an array arr[] consisting of N positive integers, the task is to find the minimum number of pairs (arr[i], arr[j]) from the given array… Read More
Given an integer N, the task is to find the smallest composite number which is not divisible by first N prime numbers. Examples: Input: N… Read More
Given an array arr[] consisting of N elements, the task is to minimize the array length by replacing any two coprime array elements with 1.Examples:… Read More
Courses
