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 |
n = 35007;
word = 'LOOSE';
assert(isequal(calc_spell_num(word),n))
|
2 | Pass |
n = 77345;
word = 'ShELL';
assert(isequal(calc_spell_num(word),n))
|
3 | Pass |
n = 36138;
word = 'BEIgE';
assert(isequal(calc_spell_num(word),n))
|
4 | Pass |
n = 378806;
word = 'gOBBLE';
assert(isequal(calc_spell_num(word),n))
|
5 | Pass |
n = 376006;
word = 'gOOgLE';
assert(isequal(calc_spell_num(word),n))
|
6 | Pass |
n = 57738461375;
word = 'SLEIghBELLS';
assert(isequal(calc_spell_num(word),n))
|
7 | Pass |
n = 0.7734;
word = 'hELLO';
assert(isequal(calc_spell_num(word),n))
|
8 | Pass |
n = 53045;
word = 'ShOES';
assert(isequal(calc_spell_num(word),n))
|
9 | Pass |
n = 771;
word = 'ILL';
assert(isequal(calc_spell_num(word),n))
|
10 | Pass |
n = 345;
word = 'ShE';
assert(isequal(calc_spell_num(word),n))
|
11 | Pass |
n = 7735;
word = 'SELL';
assert(isequal(calc_spell_num(word),n))
|
12 | Pass |
ind = randi(4);
n_arr = [36138 707 7714 57738];
n = n_arr(ind);
word_arr = {'BEIgE','LOL','hILL','BELLS'};
word = word_arr{ind};
assert(isequal(calc_spell_num(word),n))
|
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!