##
Minimum number of deletions to make a sorted sequence
May 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 »

May 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 »

February 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 »

December 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 »

July 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 »

July 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 »

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 »

August 23, 2014

Given an array of random numbers, find longest monotonically increasing subsequence (LIS) in the array.

November 23, 2012

In my previous post, I have explained about longest increasing sub-sequence (LIS) problem in detail.

September 15, 2012

We have discussed Dynamic Programming solution for Longest Increasing Subsequence problem in this post and a O(nLogn) solution in this post.

May 18, 2012

After few months of gap posting an algo. The current post is pending from long time, and many readers (e.g. here, here, here may be few more,… Read More »

May 15, 2012

Given an array of n positive integers. Write a program to find the sum of maximum sum subsequence of the given array such that the… Read More »

June 5, 2011

We have discussed Overlapping Subproblems and Optimal Substructure properties in Set 1 and Set 2 respectively.