Tag Archives: subsequence

Given an array arr[] consisting of N positive integers, and an integer K, the task is to find the maximum possible even sum of any… Read More
Given an array arr[] of size N, the task is to find the maximum sum of a subsequence formed by concatenating disjoint subarrays whose lengths… Read More
Given two arrays A[] and B[] consisting of N and M integers respectively, and an integer C, the task is to find the minimum cost… Read More
Given an array arr[] consisting of N positive integers, the task is to find the maximum sum of subsequence from the given array such that… Read More
Given an array arr[] of size N, the task is to find the smallest subsequence of the given array whose GCD of the subsequence is… Read More
Given a binary string S of length N, the task is to find the minimum number of characters required to be deleted from the string… Read More
Given an array arr[] consisting of non-negative integers, the task is to print the length of the longest subsequence from the given array whose sum… Read More
Given an array, arr[] of size N and an integer K, the task is to find the length of the longest subsequence from the given… Read More
Given an array arr[] consisting of N integers and an integer X, the task is to split the array into two subsequences such that the… Read More
Given an array arr[] consisting of N positive integers, the task is to generate all distinct subsequences of the array. Examples: Input: arr[] = {1,… Read More
Given two strings A and B, the task is to find the smallest substring of A having B as a subsequence. Examples: Input: A =… Read More
Given an integer K and a numeric string str, the task is to find the longest subsequence from the given string which is divisible by… Read More
Given an array arr[] consisting of N positive integers, the task is to maximize the number of subsequences that can be obtained from an array… Read More
Given two strings A and B where string A is an anagram of string B. In one operation, remove the first or the last character… Read More
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