This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
lo = 1;
hi = 15;
y_correct = 1:15;
assert(isequal(subindeces(lo,hi),y_correct))
idx =
logical
0
R =
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
|
2 | Pass |
lo = [1 5 10];
hi = [3 8 15];
y_correct = [1 2 3 5 6 7 8 10 11 12 13 14 15];
assert(isequal(subindeces(lo,hi),y_correct))
idx =
1×3 logical array
0 0 0
R =
1 2 3
R =
1 2 3 5 6 7 8
R =
1 2 3 5 6 7 8 10 11 12 13 14 15
|
3 | Pass |
lo = [3 5 6 7];
hi = [1 4 6 8];
y_correct = [6 7 8];
assert(isequal(subindeces(lo,hi),y_correct))
idx =
1×4 logical array
1 1 0 0
R =
6
R =
6 7 8
|
4 | Pass |
lo = 1:5;
hi = [5 4 3 2 1];
y_correct = [1 2 3 4 5 2 3 4 3];
assert(isequal(subindeces(lo,hi),y_correct))
idx =
1×5 logical array
0 0 0 1 1
R =
1 2 3 4 5
R =
1 2 3 4 5 2 3 4
R =
1 2 3 4 5 2 3 4 3
|
5370 Solvers
Project Euler: Problem 5, Smallest multiple
241 Solvers
Do Fast Fourier Transformation
178 Solvers
07 - Common functions and indexing 2
256 Solvers
Deleting an element in a matrix
242 Solvers