## Length of the longest subsequence such that xor of adjacent elements is non-decreasing

Given a sequence arr of N positive integers, the task is to find the length of the longest subsequence such that xor of adjacent integers… Read More »

- Maximum Sum Subsequence of length k
- Find the minimum number of elements that should be removed to make an array good
- Maximum subsequence sum such that all elements are K distance apart
- Total number of odd length palindrome sub-sequence around each centre
- Check whether a subsequence exists with sum equal to k if arr[i]> 2*arr[i-1]
- Number of Subsequences with Even and Odd Sum
- Find minimum length sub-array which has given sub-sequence in it
- Subsequence X of length K such that gcd(X[0], X[1]) + (X[2], X[3]) + ... is maximized
- Longest subsequence such that every element in the subsequence is formed by multiplying previous element with a prime
- Longest subsequence with first and last element greater than all other elements
- Print all Increasing Subsequence of a List
- Number of sub-sequence such that it has one consecutive element with difference less than or equal to 1
- Find all combinations of two equal sum subsequences
- Number of N length sequences whose product is M
- Maximum sum in an array such that every element has exactly one adjacent element to it
- Longest sub-sequence that satisfies the given conditions
- Count of sub-sequences which satisfy the given condition
- Number of Subsequences with Even and Odd Sum | Set 2
- Count the number of subsequences of length k having equal LCM and HCF
- Longest alternative parity subsequence
- Distinct strings such that they contains given strings as sub-sequences
- Longest subsequence with at least one character appearing in every string
- Maximum Bitwise AND value of subsequence of length K
- Product of Primes of all Subsets
- Find the count of subsequences where each element is divisible by K
- Longest Consecuetive Subsequence when only one insert operation is allowed
- Maximum sub-sequence sum such that indices of any two adjacent elements differs at least by 3
- Concatenate the strings in an order which maximises the occurrence of subsequence "ab"
- Minimum cost of choosing 3 increasing elements in an array of size N
- Check if the product of every contiguous subsequence is different or not in a number

Given a sequence arr of N positive integers, the task is to find the length of the longest subsequence such that xor of adjacent integers… Read More »

Given an array arr[], the task is to find the longest subsequence with a given OR value M. If there is no such sub-sequence then… Read More »

Given an array arr[] and an integer M, the task is to find the longest subsequence with a given AND value M. If there is… Read More »

Given an array arr[] and an integer M, the task is to find the length of the longest subsequence whose sum is divisible by M.… Read More »

Given an array arr[], the task is to find the longest subsequence with a given AND value M. If there is no such sub-sequence then… Read More »

Given an array arr[] of length N, the task is to find the length of the largest sub-sequence with non-negative sum. Examples: Input: arr[] =… Read More »

Given an array arr[] of length N, the task is to find the length of the longest sub-sequence with maximum possible GCD. Examples: Input: arr[]… Read More »

Given an array arr[] of length N, the task is to find the length of the longest sub-sequence with minimum possible LCM. Examples: Input: arr[]… Read More »

Given an array arr[] of size N and an integer K, the task is to find the number of K length subsequences of this array… Read More »

Given an array Arr and an integer K. The task is to find the number of subsequences of size K such that the LCM and… Read More »

Given N strings containing of characters ‘a’ and ‘b’. These string can be concatenated in any order to make a single final string S. The… Read More »

Given two arrays arr[] and cost[] where cost[i] is the cost associated with arr[i], the task is to find the minimum cost of choosing three… Read More »

Given an array arr[] and an integer K, the task is to find the total number of subsequences from the array where each element is… Read More »

Given an array arr[] of N integers and another integer K. The task is to find the maximum sum of a subsequence such that the… Read More »

Given an array arr[] of size N. The task is to find the number of subsequences whose sum is even and the number of subsequences… Read More »