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

• Return the 3n+1 sequence for n

  8535 Solvers

• Elapsed Time

  3054 Solvers

• Calculate the Levenshtein distance between two strings

  1513 Solvers

• middleAsColumn: Return all but first and last element as a column vector

  653 Solvers

• Make a random, non-repeating vector.

  11808 Solvers

More from this Author174

• Sub-sequence - 03

  19 Solvers

• 'X'avier

  19 Solvers

• Decimal Fraction to binary conversion

  11 Solvers

• Sort Non-zeros

  18 Solvers

• Sieve of Eratosthenes

  24 Solvers