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 Solvers17

Suggested Problems

• Convert a numerical matrix into a cell array of strings

  2235 Solvers

• "Look and say" sequence

  221 Solvers

• Oh Zero Zero Zero!!!

  497 Solvers

• Length of the hypotenuse

  15706 Solvers

• If-then-else

  380 Solvers

More from this Author174

• The Dark Knight

  14 Solvers

• Can the knight take out the pawn?

  12 Solvers

• Yoonir - 02

  18 Solvers

• Abelian Sandpile - 01

  15 Solvers

• check whether a number is a pentatope number

  62 Solvers