Problem 45473. Sub-sequence - 01

a=[2,4,2,1,3,5,6]
longest increasing subsequence = [2,4,5,6]
                               = [1,3,5,6]
                               = [2,3,5,6]
so, length = 4

Solution Comments

Problem Recent Solvers13

Suggested Problems

• Read a column of numbers and interpolate missing data

  2282 Solvers

• How to find the position of an element in a vector without using the find function

  2728 Solvers

• Increment a number, given its digits

  650 Solvers

• Given a window, how many subsets of a vector sum positive

  851 Solvers

• prime test

  230 Solvers

More from this Author165

• Queen's move - 02

  7 Solvers

• Minimal Path - 04

  9 Solvers

• ZigZag - 03

  19 Solvers

• cofactor matrix

  24 Solvers

• Sum! Sum! Sum!

  38 Solvers