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 Solvers22

Suggested Problems

• Extract leading non-zero digit

  2246 Solvers

• Renaming a field in a structure array

  1578 Solvers

• Getting the indices from a vector

  11838 Solvers

• Removing rows from a matrix is easy - but what about inserting rows?

  265 Solvers

• Generate a vector like 1,2,2,3,3,3,4,4,4,4

  13681 Solvers

More from this Author174

• The End of the World

  55 Solvers

• Fibonacci Word

  23 Solvers

• Minimal Path - 03

  9 Solvers

• Take a binary number as input,rearrange it in any manner such that its value is greater than the original one.output should be all the possible values in decimal.

  15 Solvers

• Chain multiplication - 03

  9 Solvers