# Tag Archives: LIS

## Largest increasing subsequence of consecutive integersNovember 10, 2017

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 TreeOctober 21, 2017

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 arraysSeptember 26, 2017

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 1September 1, 2017

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 array with minimum changesAugust 15, 2017

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

## Longest Bitonic Subsequence in O(n log n)August 1, 2017

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 mannerJune 22, 2017

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

## Dynamic Programming | Building BridgesJune 2, 2017

Consider a 2-D map with a horizontal river passing through its center. There are n cities on the southern bank with x-coordinates a(1) … a(n)… Read More »

## Minimum insertions to sort an arrayMay 31, 2017

Given an array of integer numbers, we need to sort this array in a minimum number of steps where in one step we can insert… Read More »

## Minimum number of deletions to make a sorted sequenceMay 18, 2017

Given an array of n integers. The task is to remove or delete minimum number of elements from the array so that when the remaining… Read More »

## Size of array after repeated deletion of LISFebruary 23, 2017

Given an array arr[0..n-1] of positive element. The task is to print remaining elements of arr[] after repeated deletion of LIS (of size greater than… Read More »

## Longest subsequence such that difference between adjacents is oneDecember 15, 2016

Given an array of n size, the task is to find the longest subsequence such that difference between adjacents is one. Examples: Input : arr[]… Read More »

## Printing Maximum Sum Increasing SubsequenceJuly 24, 2016

The Maximum Sum Increasing Subsequence problem is to find the maximum sum subsequence of a given sequence such that all elements of the subsequence are… Read More »

## Construction of Longest Increasing Subsequence using Dynamic ProgrammingJuly 19, 2016

The longest Increasing Subsequence (LIS) problem is to find the length of the longest subsequence of a given sequence such that all elements of the… Read More »

## Longest Common Increasing Subsequence (LCS + LIS)June 18, 2016

Prerequisites : LCS, LIS Given two arrays, find length of the longest common increasing subsequence [LCIS] and print one of such sequences (multiple sequences may… Read More »