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 Solvers20

Suggested Problems

• Reverse Run-Length Encoder

  2713 Solvers

• Number of 1s in the Binary Representation of a Number

  476 Solvers

• Matrix indexing with two vectors of indices

  769 Solvers

• Transpose

  549 Solvers

• Check if a matrix is a palindrome in all directions

  128 Solvers

More from this Author174

• Cut the rod

  12 Solvers

• MinMax mapping

  23 Solvers

• Successive zeros

  17 Solvers

• Adjoint matrix

  30 Solvers

• Hanging cable - 02

  9 Solvers