Test | Status | Code Input and Output |
---|---|---|
1 | Fail |
sequence = [1 2 3 4 5 7 8 9 24 25 26 27 28 29 30 31 32];
bounds = [1 5 7 9 24 32];
assert(isequal(CompressSequence(sequence), bounds))
|
2 | Fail |
sequence = [100:200 300:400];
bounds = [100 200 300 400];
assert(isequal(CompressSequence(sequence), bounds))
|
3 | Fail |
sequence = -10:10;
bounds = [-10 10];
assert(isequal(CompressSequence(sequence), bounds))
|
4 | Fail |
sequence = [9 11];
bounds = [9 9 11 11];
assert(isequal(CompressSequence(sequence), bounds))
|
5 | Fail |
sequence = 1:2:99;
temp = [1:2:99; 1:2:99];
bounds = temp(:)';
assert(isequal(CompressSequence(sequence), bounds))
|
Test if a Number is a Palindrome without using any String Operations
181 Solvers
404 Solvers
Who knows the last digit of pi?
557 Solvers
579 Solvers
134 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!