Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
n = 35007;
word = 'LOOSE';
assert(isequal(calc_spell_num(word),n))
word =
'L00SE'
word =
'L00SE'
word =
'L00SE'
word =
'L00S3'
word =
'L00S3'
word =
'L0053'
word =
'L0053'
word =
'70053'
word =
'70053'
word =
'35007'
n =
35007
|
2 | Pass |
n = 77345;
word = 'ShELL';
assert(isequal(calc_spell_num(word),n))
word =
'ShELL'
word =
'ShELL'
word =
'ShELL'
word =
'Sh3LL'
word =
'S43LL'
word =
'543LL'
word =
'543LL'
word =
'54377'
word =
'54377'
word =
'77345'
n =
77345
|
3 | Pass |
n = 36138;
word = 'BEIgE';
assert(isequal(calc_spell_num(word),n))
word =
'BEIgE'
word =
'BE1gE'
word =
'BE1gE'
word =
'B31g3'
word =
'B31g3'
word =
'B31g3'
word =
'B3163'
word =
'B3163'
word =
'83163'
word =
'36138'
n =
36138
|
4 | Pass |
n = 378806;
word = 'gOBBLE';
assert(isequal(calc_spell_num(word),n))
word =
'g0BBLE'
word =
'g0BBLE'
word =
'g0BBLE'
word =
'g0BBL3'
word =
'g0BBL3'
word =
'g0BBL3'
word =
'60BBL3'
word =
'60BB73'
word =
'608873'
word =
'378806'
n =
378806
|
5 | Pass |
n = 376006;
word = 'gOOgLE';
assert(isequal(calc_spell_num(word),n))
word =
'g00gLE'
word =
'g00gLE'
word =
'g00gLE'
word =
'g00gL3'
word =
'g00gL3'
word =
'g00gL3'
word =
'6006L3'
word =
'600673'
word =
'600673'
word =
'376006'
n =
376006
|
6 | Pass |
n = 57738461375;
word = 'SLEIghBELLS';
assert(isequal(calc_spell_num(word),n))
word =
'SLEIghBELLS'
word =
'SLE1ghBELLS'
word =
'SLE1ghBELLS'
word =
'SL31ghB3LLS'
word =
'SL31g4B3LLS'
word =
'5L31g4B3LL5'
word =
'5L3164B3LL5'
word =
'573164B3775'
word =
'57316483775'
word =
'57738461375'
n =
5.7738e+10
|
7 | Pass |
n = 0.7734;
word = 'hELLO';
assert(isequal(calc_spell_num(word),n))
word =
'hELL0'
word =
'hELL0'
word =
'hELL0'
word =
'h3LL0'
word =
'43LL0'
word =
'43LL0'
word =
'43LL0'
word =
'43770'
word =
'43770'
word =
'07734'
word =
'0.7734'
n =
0.7734
|
8 | Pass |
n = 53045;
word = 'ShOES';
assert(isequal(calc_spell_num(word),n))
word =
'Sh0ES'
word =
'Sh0ES'
word =
'Sh0ES'
word =
'Sh03S'
word =
'S403S'
word =
'54035'
word =
'54035'
word =
'54035'
word =
'54035'
word =
'53045'
n =
53045
|
9 | Pass |
n = 771;
word = 'ILL';
assert(isequal(calc_spell_num(word),n))
word =
'ILL'
word =
'1LL'
word =
'1LL'
word =
'1LL'
word =
'1LL'
word =
'1LL'
word =
'1LL'
word =
'177'
word =
'177'
word =
'771'
n =
771
|
10 | Pass |
n = 345;
word = 'ShE';
assert(isequal(calc_spell_num(word),n))
word =
'ShE'
word =
'ShE'
word =
'ShE'
word =
'Sh3'
word =
'S43'
word =
'543'
word =
'543'
word =
'543'
word =
'543'
word =
'345'
n =
345
|
11 | Pass |
n = 7735;
word = 'SELL';
assert(isequal(calc_spell_num(word),n))
word =
'SELL'
word =
'SELL'
word =
'SELL'
word =
'S3LL'
word =
'S3LL'
word =
'53LL'
word =
'53LL'
word =
'5377'
word =
'5377'
word =
'7735'
n =
7735
|
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))
word =
'hILL'
word =
'h1LL'
word =
'h1LL'
word =
'h1LL'
word =
'41LL'
word =
'41LL'
word =
'41LL'
word =
'4177'
word =
'4177'
word =
'7714'
n =
7714
|
Create a vector whose elements depend on the previous element
391 Solvers
282 Solvers
Find out sum and carry of Binary adder
379 Solvers
Calculator spelling - Numbers to Letters
35 Solvers
71 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!