Cody

Problem 42837. Increasing sub-sequence (Level 1)

Solution 1030369

Submitted on 24 Oct 2016 by Alfonso Nieto-Castanon
  • Size: 22
  • This is the leading solution.
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Solve This Problem View on Solution Map

Test Suite

Test Status Code Input and Output
1   Pass
v = [2 18 9 6 11 20 25 3]; n_correct = 4; assert(isequal(subseq(v),n_correct))
2   Pass
v = [-6 -18 -9 -4 -11 -20 -25 -3]; n_correct = 3; assert(isequal(subseq(v),n_correct))
3   Pass
v = zeros(1,30); n_correct = 1; assert(isequal(subseq(v),n_correct))
4   Pass
v = [exp(-1) sqrt(2) sqrt(3) exp(1) pi exp(2)]; n_correct = 6; assert(isequal(subseq(v),n_correct))
5   Pass
v = 100:-10:-100; n_correct = 1; assert(isequal(subseq(v),n_correct))
6   Pass
v = [0:5 1:7 3:9 2:8]; n_correct = 7; assert(isequal(subseq(v),n_correct))

Suggested Problems

More from this Author34

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!