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

• Swap the first and last columns

  22535 Solvers

• Remove all the words that end with "ain"

  2636 Solvers

• given 3 sides, find area of this triangle

  819 Solvers

• Construct an index vector from two input vectors in vectorized fashion

  449 Solvers

• Vector creation

  10784 Solvers

More from this Author174

• Fangs of pseudo-vampire number

  25 Solvers

• Number of leaps in binary search

  10 Solvers

• Maya long Count

  14 Solvers

• Ugly numbers - 02

  20 Solvers

• The Tortoise and the Hare - 02

  21 Solvers