# Tag Archives: subsequence

Given an array arr[] of N positive integers, the task is to find the maximum sum of a subsequence consisting of no K consecutive array… Read More
Given an array arr[] consisting of N integers, the task is to find the length of the longest increasing absolute even subsequence. An increasing absolute… 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[] of N integers, the task is to find the length of the longest increasing subsequence such that it forms a subarray… Read More
Given two arrays arr[] and brr[] of size N such that the array brr[] consists of scores associated with corresponding elements of the array arr[].… Read More
Given an array arr[] of size N, the task is to find the length of the longest subsequence consisting of distinct elements only. Examples:  Input:… Read More
Given an array arr[] consisting of N integers, the task is to find the maximum subsequence sum by multiplying each element of the resultant subsequence… Read More
Given two strings str1 and str2, where str2 is a subsequence of str1, the task is to find the length of the longest substring of… Read More
Given an array arr[] consisting of N integers, the task is to find the length of the longest subsequence than forms an Arithmetic Progression. Examples:… 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[] consisting of N integers, the task is to find the number of subsequences which contain the maximum as well as the… Read More
Given an array A[] consisting of N distinct integers and another array B[] consisting of M integers, the task is to find the minimum number… Read More
Given a string S of valid parentheses sequence of length N and an even integer K, the task is to find the valid parentheses sequence… 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 two strings A and B, the task is to count the minimum number of operations required to convert the string A to B. In… Read More