## Count of lists which are not a subset of any other given lists

Given N lists of strings, the task is to find the count of lists which are not a sublist of any other given lists. Examples:… Read More »

- Count number of increasing sub-sequences : O(NlogN)
- Find all subsequences with sum equals to K
- Longest increasing sub-sequence formed by concatenating array to itself N times
- Sum of all subsequences of length K
- Count of possible subarrays and subsequences using given length of Array
- Print all subsequences of a string in Python
- Number of subsequences with positive product
- Length of Smallest Subsequence such that sum of elements is greater than equal to K
- Smallest Palindromic Subsequence of Even Length in Range [L, R]
- Maximize product of digit sum of consecutive pairs in a subsequence of length K
- Count the number of contiguous increasing and decreasing subsequences in a sequence
- Maximum sum subsequence with values differing by at least 2
- Length of longest subsequence of Fibonacci Numbers in an Array
- Maximize product of same-indexed elements of same size subsequences
- Count of Subsets containing only the given value K
- Maximum length Subsequence with alternating sign and maximum Sum
- Maximum product of bitonic subsequence of size 3
- Longest subsequence consisting of alternate vowels and consonants
- Longest alternating subsequence which has maximum sum of elements
- Count of subsequences whose product is a difference of square of two integers
- Minimum number of subsequences required to convert one string to another using Greedy Algorithm
- Maximum subsequence sum with adjacent elements having atleast K difference in index
- Length of longest increasing index dividing subsequence
- Longest subarray with all elements same
- Count of K length subsequence whose product is even
- Longest subsequence possible that starts and ends with 1 and filled with 0 in the middle
- Maximize sum of all elements which are not a part of the Longest Increasing Subsequence
- Minimum number of subsequences required to convert one string to another
- Count subsequences with same values of Bitwise AND, OR and XOR
- Longest Subsequence of a String containing only vowels

Given N lists of strings, the task is to find the count of lists which are not a sublist of any other given lists. Examples:… Read More »

Given a large number in form of string str of size N, the task is to count the subsequence of length 4 whose digit are… Read More »

Given a string str of lowercase English alphabets, our task is to find the frequency of occurrence a subsequence of the string which occurs the… Read More »

Given an array arr[] of N integers and two numbers K and S, the task is to print all the subsquence of length K with… Read More »

Given an array A[] of size N, find the Maximum Xor Subsequence such that both A [ i ] and A [ N – i… Read More »

Given an array arr[] of length N, containing values in the range [1, N], the task is to find a subsequence s1, s2, …, sk… Read More »

Given an integer array arr[] of size N and an integer X, the task is to count the number of subsequences in that array such… Read More »

Given an array arr[] of N integers, the task is to print the subsequence from the given array with the maximum pairwise absolute difference of… Read More »

Given a non-empty string S, the task is to print the longest subsequence from the string S which contains alternating vowels and consonants. Note: If… Read More »

Given an array arr[] of integers, the task is to check if it is possible to obtain a subsequence of K elements from the array… Read More »

Given two integer arrays a[] and b[], the task is to find the maximum possible product of the same indexed elements of two equal length… Read More »

Given an array arr[], the task is to find the maximum sum of all the elements which are not a part of the longest increasing… Read More »

Given a binary string s, the task is to find the length of longest subsequence that can be divided into three substrings such that the… Read More »

Given a string S of lowercase letters, the task is to find the length of the longest palindromic subsequence made up of two distinct characters… Read More »

Given an array arr[] consisting of integers of length N and an integer K (1 <= K <= N), the task is to find the… Read More »