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 Solvers26

Suggested Problems

• Knight's Tour Checker

  1477 Solvers

• Increment a number, given its digits

  690 Solvers

• Recurring Cycle Length (Inspired by Project Euler Problem 26)

  168 Solvers

• Back to basics 21 - Matrix replicating

  1831 Solvers

• Rotate input square matrix 90 degrees CCW without rot90

  699 Solvers

More from this Author174

• XOR fibonacci

  24 Solvers

• cofactor matrix

  29 Solvers

• The Tortoise and the Hare - 02

  26 Solvers

• Maya - 02

  11 Solvers

• Sum! Sum! Sum!

  44 Solvers