Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
x = {'12','15','14','23','24','26','28','33','38','39'}
y_correct = {'1245','23468','3389'}
assert(isequal(stem_leaf(x),y_correct))
x =
'12' '15' '14' '23' '24' '26' '28' '33' '38' '39'
y_correct =
'1245' '23468' '3389'
|
2 | Pass |
%%
x = {'00','11','02','33','32','31','34','14'}
y_correct = {'002','114','31234'}
assert(isequal(stem_leaf(x),y_correct))
x =
'00' '11' '02' '33' '32' '31' '34' '14'
y_correct =
'002' '114' '31234'
|
3 | Pass |
%%
x = {'04','13','12','11','14','16','17','18','13','12','11','14','16','17','18'}
y_correct = {'04','111223344667788'}
assert(isequal(stem_leaf(x),y_correct))
x =
'04' '13' '12' '11' '14' '16' '17' '18' '13' '12' '11' '14' '16' '17' '18'
y_correct =
'04' '111223344667788'
|
4 | Pass |
%%
x = {'23','123','125','105','24','106'}
y_correct = {'234','1056','1235'}
assert(isequal(stem_leaf(x),y_correct))
x =
'23' '123' '125' '105' '24' '106'
y_correct =
'234' '1056' '1235'
|
5 | Pass |
%%
x = {'01','12','33','45','54','67'};
y_correct = x;
assert(isequal(stem_leaf(x),y_correct))
|
Project Euler: Problem 1, Multiples of 3 and 5
1064 Solvers
Nonuniform quantizer as a piecewise constant function
44 Solvers
378 Solvers
322 Solvers
Count letters occurence in text, specific to words with a given length.
40 Solvers