# Tag Archives: LIS

## Number of Longest Increasing Subsequences

Given an array arr[] of size N, the task is to count the number of longest increasing subsequences present in the given array. Examples: Input:… Read More »

## Length of the longest increasing subsequence which does not contain a given sequence as Subarray

Given two arrays arr[] and arr1[] of lengths N and M respectively, the task is to find the longest increasing subsequence of array arr[] such… Read More »

## Minimum cost required to rearrange a given array to make it equal to another given array

Given two arrays A[] and B[] consisting of N and M integers respectively, and an integer C, the task is to find the minimum cost… Read More »

## Minimize elements to be added to a given array such that it contains another given array as its subsequence | Set 2

Given an array A[] consisting of N distinct integers and another array B[] consisting of M integers, the task is to find the minimum number… Read More »

## Length of longest increasing absolute even subsequence

Given an array arr[] consisting of N integers, the task is to find the length of the longest increasing absolute even subsequence. An increasing absolute… Read More »

## Length of longest increasing prime subsequence from a given array

Given an array arr[] consisting of N positive integers, the task is to find the length of the longest increasing subsequence consisting of Prime Numbers… Read More »

## Longest Increasing Subsequence having sum value atmost K

Given an integer array arr[] of size N and an integer K. The task is to find length of longest subsequence whose sum is less… Read More »

## Longest Reverse Bitonic Sequence

Given an arr[] of length N, the task is to find the length of longest Reverse Bitonic Subsequence. A subsequence is called Reverse Bitonic if… Read More »

## Longest increasing sequence by the boundary elements of an Array

Given an array arr[] of length N with unique elements, the task is to find the length of the longest increasing subsequence that can be… Read More »

## Minimum concatenation required to get strictly LIS for array with repetitive elements | Set-2

Given an array A[] of size n where there can be repetitive elements in the array. We have to find the minimum concatenation required for… Read More »

## Longest increasing sub-sequence formed by concatenating array to itself N times

Given an array arr[] of size N, the task is to find the length of the longest increasing subsequence in the array formed by the… Read More »

## 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, 5,… 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 »