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

• Project Euler: Problem 5, Smallest multiple

  1681 Solvers

• Back to basics 14 - Keywords

  470 Solvers

• Back to basics 21 - Matrix replicating

  1831 Solvers

• Check if number exists in vector

  14603 Solvers

• Integer Sequence - II : New Fibonacci

  705 Solvers

More from this Author174

• Connect Four - 04

  7 Solvers

• One-hot encoding

  38 Solvers

• Do they touch?

  27 Solvers

• Maya - 01

  14 Solvers

• Yoonir - 03

  20 Solvers