store all the indices wherever the value decreases. all subsequences
between 0, these indices and the end index n are increasing
subsequences.
Check which of these are of length K.
On Jan 26, 11:17 pm, atul anand atul.87fri...@gmail.com wrote:
Hi,
suggest an algo which will find all longest
ADOBE asks the very basic C/C++ questions
one of their toughest however was :
every number ending in 3 has a multiple of the form 111...111
e.g 3 has 111
13 has 11
so on..
find the algo for finding the number for an input number ending in 3.
On Aug 5, 2:33 pm, Agyat
