# Tag Archives: subsequence

Given an A “1″s, B “10”s, and C “0”s, the task is to count of sum of “10” subsequences for each 1s in the string… Read More
Given two integer arrays A[] and B[] of different length N and M respectively, the task is to choose any subsequence of same length from… Read More
Given an array A[]. The task is to count the number of subsequences such that concatenation of binary representation of the numbers represents palindrome. Examples:… Read More
Given an array Arr[] of size N and an integer K, the task is to find the length of the shortest subsequence having sum exactly… Read More
Given an array Arr[ ] of N integers where 1 ≤ N ≤ 105. The task is to choose any number of elements from the… Read More
Given an array arr[] of length N. The task is to find the length of the longest subsequence of the array such that the absolute… Read More
Given two arrays a[] and b[] and an integer K, the task is to find the length of the longest common subsequence such that sum… Read More
Given an array arr of integers of size N, the task is to find a subsequence in which upon reversing the order, the maximum sum… Read More
Given an array A[] of size N, find two Sub-sequences a and b, such that the sum of the average of two subsequences is maximized… Read More
Given two strings A and B, the task is to find the smallest substring of A having B as a subsequence. If there are multiple… Read More
Given an array arr[] of N elements, the task is to find the length of the longest increasing subsequence whose adjacent element difference is one. … Read More
Given three binary strings a, b, and c each having 2*N characters each, the task is to find a string having almost 3*N characters such… Read More
Given a numeric string S, the task is to find the maximum length of a subsequence having its left rotation equal to its right rotation.… Read More
Given two strings S and T of lengths n and m respectively. Find the maximum adjacent index difference for the indices where string T is… Read More
Given a string S of length N and a positive integer K, the task is to find the minimum total cost of picking K unique… Read More