## Longest Increasing Subsequence using Longest Common Subsequence Algorithm

Given an array arr[] of N integers, the task is to find and print the Longest Increasing Subsequence. Examples: Input: arr[] = {12, 34, 1,… Read More »

## Minimum number of increasing subsequences

Given an array of integers of size N, you have to divide it into the minimum number of “strictly increasing subsequences” For example: let the… Read More »

## Longest dividing subsequence

You are given an array A of size N. Your task is to find the length of largest dividing sub sequence.A dividing sequence is a… Read More »

## Dilworth’s Theorem

Let S be a finite partially ordered set. The size of a maximal antichain equals the size of a minimal chain cover of S. This… Read More »

## Maximum Sum Decreasing Subsequence

Given an array of N positive integers. The task is to find the sum of maximum sum decreasing subsequence(MSDS) of the given array such that… Read More »

## Maximum sum increasing subsequence from a prefix and a given element after prefix is must

Given an array of n positive integers, write a program to find the maximum sum of increasing subsequence from prefix till i-th index and also… Read More »

## Maximum product of an increasing subsequence

Given an array of numbers, find the maximum product formed by multiplying numbers of an increasing subsequence of that array. Note: A single number is… Read More »

## Count number of increasing subsequences of size k

Given an array arr[] containing n integers. The problem is to count number of increasing subsequences in the array of size k. Examples: Input :… Read More »

## Largest increasing subsequence of consecutive integers

Given an array of n positive integers. We need to find the largest increasing sequence of consecutive positive integers. Examples: Input : arr[] = {5,… Read More »

## LIS using Segment Tree

You are given an array of integers, you need to find the length of the longest increasing sub-sequence. There can be 4 approaches for solving… Read More »

## Find longest bitonic sequence such that increasing and decreasing parts are from two different arrays

We are given two arrays, we need to find the longest possible bitonic sequence such that increasing part must be from first array and should… Read More »

## Maximum length subsequence with difference between adjacent elements as either 0 or 1

Given an array of n integers. The problem is to find maximum length of the subsequence with difference between adjacent elements as either 0 or… Read More »

## Convert to Strictly increasing integer array with minimum changes

Given an array of n integers. Write a program to find minimum number of changes in array so that array is strictly increasing of integers.… Read More »

## Longest Bitonic Subsequence in O(n log n)

Given an array arr[0 … n-1] containing n positive integers, a subsequence of arr[] is called Bitonic if it is first increasing, then decreasing. Write… Read More »

## Find the Longest Increasing Subsequence in Circular manner

Given an array, the task is to find to LIS (Longest Increasing Subsequence) in a circular way. Examples : Input : arr[] = {5, 4,… Read More »