Variations of LIS – Dynamic Programming – We have discussed Dynamic Programming solution for Longest Increasing Subsequence problem in this post
closest pair
3 Articles
3
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.
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 pair has an element from each array.