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

• Select every other element of a vector

  37481 Solvers

• Make an awesome ramp for a tiny motorcycle stuntman

  787 Solvers

• Removing rows from a matrix is easy - but what about inserting rows?

  279 Solvers

• "mirror" matrix

  701 Solvers

• Implement a bubble sort technique and output the number of swaps required

  404 Solvers

More from this Author174

• Decimal to binary conversion (without using built-in function)

  21 Solvers

• Ugly numbers - 02

  22 Solvers

• An n-sided regular polygon is drawn within a circle whose radius is 'r', what will be the area of the polygon?

  40 Solvers

• Frugal number

  55 Solvers

• cofactor matrix

  29 Solvers