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))
q =
cell
[1×15 double]
|
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))
q =
1×3 cell array
[1×3 double] [1×4 double] [1×6 double]
|
3 | Pass |
lo = [3 5 6 7];
hi = [1 4 6 8];
y_correct = [6 7 8];
assert(isequal(subindeces(lo,hi),y_correct))
q =
1×4 cell array
[1×0 double] [1×0 double] [6] [1×2 double]
|
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))
q =
1×5 cell array
[1×5 double] [1×3 double] [3] [1×0 double] [1×0 double]
|
323 Solvers
689 Solvers
1021 Solvers
223 Solvers
Number of digits in an integer
271 Solvers