## Longest subsequence with at least one character appearing in every string

Given a string array arr[], the task is to find the longest sub-sequence of the array with at least one character appearing in all the… Read More »

- Longest subsequence such that adjacent elements have at least one common digit
- Maximum sum such that no two elements are adjacent | Set 2
- Find the minimum number of elements that should be removed to make an array good
- Find the lexicographically largest palindromic Subsequence of a String
- Total number of odd length palindrome sub-sequence around each centre
- Find the longest subsequence of an array having LCM at most K
- Sum of minimum element of all sub-sequences of a sorted array
- Maximum Sum Subsequence of length k
- Check whether a subsequence exists with sum equal to k if arr[i]> 2*arr[i-1]
- Maximum sum possible for a sub-sequence such that no two elements appear at a distance < K in the array
- Longest subsequence with first and last element greater than all other elements
- Find minimum length sub-array which has given sub-sequence in it
- Lexicographically largest sub-sequence of the given string
- Number of subsequences with zero sum
- Divide array into increasing and decreasing subsequence without changing the order
- Product of all Subsequences of size K except the minimum and maximum Elements
- Longest subsequence such that every element in the subsequence is formed by multiplying previous element with a prime
- Number of sub-sequence such that it has one consecutive element with difference less than or equal to 1
- Longest sub-sequence that satisfies the given conditions
- Maximum sum in an array such that every element has exactly one adjacent element to it
- Minimal product subsequence where adjacent elements are separated by a maximum distance of K
- Count of sub-sequences which satisfy the given condition
- Number of N length sequences whose product is M
- Distinct strings such that they contains given strings as sub-sequences
- Minimum cost to make a string free of a subsequence
- Maximum sub-sequence sum such that indices of any two adjacent elements differs at least by 3
- Longest Consecuetive Subsequence when only one insert operation is allowed
- Longest subsequence having greater corner values
- Longest subsequence with at least one character appearing in every string

Given a string array arr[], the task is to find the longest sub-sequence of the array with at least one character appearing in all the… Read More »

Given a sorted array of N integers. The task is to find the longest subsequence such that every element in the subsequence is reachable by… Read More »

Given two strings str1 and str2 of lengths M and N respectively. The task is to find all the distinct string of length M +… Read More »

Given two integers N and M, the task is to find the count of possible sequences a1, a2, … of length N such that the… Read More »

Given an array arr[] of N elements, the task is to find the length of the smallest sub-array which has sequence {0, 1, 2, 3,… Read More »

Given a sequence of positive integers of length N. The only operation allowed is to insert a single integer of any value at any position… Read More »

Given an array arr[] of integers, the task is to find the maximum sum of any sub-sequence in the array such that any two adjacent… Read More »

Given an array of size N and an integer K. The array consists of only digits {0, 1, 2, 3, …k-1}. The task is to… Read More »

Given a string str, the task is to find the number of odd length palindromic sub-sequences around of str with str[i] as centre i.e. every… Read More »

Given a permutation from 1 to N of size N. Find the length of the longest subsequence having the property that the first and last… Read More »

Given an array arr[] of N elements. The task is to find the number of sub-sequences which have at least two consecutive elements such that… Read More »

Given a string str consisting of digits, the task is to find the number of possible 4 digit sub-sequences which are of the form (x,… Read More »

Given an array arr[] of N integers, the task is to find the longest sub-sequence in the given array such that for all pairs from… Read More »

Given a sorted array of positive integers where arr[i] > 2*arr[i-1], check whether a sub sequence exists whose sum is equal to k. Examples: Input… Read More »

Given an array arr[] of N integers, you can select some indexes such that every selected index has exactly one other selected index adjacent to… Read More »