# Tag Archives: LIS

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
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
Given an array of N positive integers. The task is to find the sum of the maximum sum decreasing subsequence(MSDS) of the given array such… Read More
Given an array of n positive integers, write a program to find the maximum sum of increasing subsequence from prefix till ith index and also… Read More
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
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
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
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
We are given two arrays, we need to find the longest possible bitonic sequence such that the increasing part must be from the first array… Read More
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
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
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
Given an array, the task is to find to LIS (Longest Increasing Subsequence) in a circular way. Examples : Input : arr[] = {5, 4,… Read More
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
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