Test | Status | Code Input and Output |
---|---|---|
1 | Fail |
s1 = 'kitten';
s2 = 'sitting';
d_correct = 3;
assert(isequal(levenshtein(s1,s2),d_correct))
|
2 | Fail |
s1 = 'Saturday';
s2 = 'Sunday';
d_correct = 3;
assert(isequal(levenshtein(s1,s2),d_correct))
|
3 | Fail |
s1 = 'MATLAB rocks!';
s2 = 'MathWorks';
d_correct = 9;
assert(isequal(levenshtein(s1,s2),d_correct))
|
4 | Fail |
s1 = 'Four score and seven years ago';
s2 = 'Eighty seven years before today';
d_correct = 25;
assert(isequal(levenshtein(s1,s2),d_correct))
|
5 | Fail |
s1 = 'Row row row your boat';
s2 = 'Gently down the stream';
d_correct = 18;
assert(isequal(levenshtein(s1,s2),d_correct))
|
6 | Fail |
s1 = 'ninety-nine bottles of beer on the wall';
s2 = 'eighty-six bottles of beer on the wall';
d_correct = 6;
assert(isequal(levenshtein(s1,s2),d_correct))
|
7 | Fail |
s1 = 'these are the times that try men''s souls';
s2 = 'soulwise, these are trying times';
d_correct = 27;
assert(isequal(levenshtein(s1,s2),d_correct))
|
Find the alphabetic word product
1999 Solvers
Given two strings, find the maximum overlap
300 Solvers
136 Solvers
07 - Common functions and indexing 4
259 Solvers
396 Solvers