#53
Longest Increasing Sub-Seq
 

Difficulty:N/A
Topics:hard seqs


Given a vector of integers, find the longest consecutive sub-sequence of increasing numbers. If two sub-sequences have the same length, use the one that occurs first. An increasing sub-sequence must have a length of 2 or greater to qualify.
test not run
(= (__ [1 0 1 2 3 0 4 5]) [0 1 2 3])
test not run
(= (__ [5 6 1 3 2 7]) [5 6])
test not run
(= (__ [2 3 3 4 5]) [3 4 5])
test not run
(= (__ [7 6 5 4]) [])


Code which fills in the blank: