Cody

Solution 1940667

Submitted on 18 Sep 2019 at 2:43 by Augusto Mazzei
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Pass
a = [1 5 3 11 7 2 4 9]; stride = 2; assert(isequal(skip_sequence_stride(a),stride))

Longest for now: 2, times: 6

2   Pass
a = [1:5:20 23:3:42 2:9:100]; stride = 9; assert(isequal(skip_sequence_stride(a),stride))

Longest for now: 5, times: 4 Longest for now: 9, times: 11

3   Pass
a = [2:2:22 13:17]; a = a(randperm(length(a))); stride = 2; assert(isequal(skip_sequence_stride(a),stride))

Longest for now: 2, times: 11

4   Pass
a = 37:5:120; a = a(randperm(length(a))); stride = 5; assert(isequal(skip_sequence_stride(a),stride))

Longest for now: 5, times: 17

5   Pass
a = [1:5 101:10:171 201:205]; a = a(randperm(length(a))); stride = 10; assert(isequal(skip_sequence_stride(a),stride))

Longest for now: 10, times: 8

6   Pass
a = [7:17:302 primes(300)]; a = sort(a); stride = 17; assert(isequal(skip_sequence_stride(a),stride))

Longest for now: 45, times: 4 Longest for now: 4, times: 5 Longest for now: 6, times: 8 Longest for now: 17, times: 18

Suggested Problems

More from this Author63