##
Minimum number of elements which are not part of Increasing or decreasing subsequence in array
January 19, 2017

Given an array of n elements. Make strictly increasing and strictly decreasing subsequences from the array such that each array element belongs to increasing subsequence or decreasing subsequence, but not both, or can be part of none of the subsequence. Minimize the number of elements which are not part of any of the subsequences and… Read More »