Variations of LIS - Dynamic Programming - We have discussed Dynamic Programming solution for Longest Increasing Subsequence problem in this post
Category - closest pair
Maximum Length Chain of Pairs - Dynamic Programming - The given problem is also a variation of Activity Selection problem and can be solved in (nLogn) time.
Given an array of strings, find if the given strings can be chained to form a circle. A string X can be put before another string Y in circle.
Find the closest pair from two sorted arrays - Searching and Sorting - Given two sorted arrays and a number x, find the pair whose sum is closest to x and the...