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 Solvers21

Suggested Problems

• Create a cell array out of a struct

  2411 Solvers

• Project Euler: Problem 6, Natural numbers, squares and sums.

  2535 Solvers

• Back to basics 11 - Max Integer

  808 Solvers

• NO _________ ALLOWED....

  225 Solvers

• Divisible by 2

  612 Solvers

More from this Author174

• Minimal Path - 03

  9 Solvers

• Area-03

  32 Solvers

• Sky full of stars - 01

  26 Solvers

• Maya - 01

  12 Solvers

• ZigZag - 01

  34 Solvers