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 | Fail |
inStr = 'ball';
strList = {'ball', 'bell', 'barn'};
assert(isequal(findMatch(inStr, strList), 'ball'));
q =
logical
0
q =
1×2 logical array
0 1
q =
1×3 logical array
0 1 1
|
2 | Fail |
inStr = 'auG';
strList = {'May', 'June', 'July', 'August', 'September'};
assert(isequal(findMatch(inStr, strList), 'August'));
q =
logical
1
q =
1×2 logical array
1 1
q =
1×3 logical array
1 1 1
q =
1×4 logical array
1 1 1 1
q =
1×5 logical array
1 1 1 1 1
|
3 | Fail |
inStr = 'Ju';
strList = {'May', 'June', 'July', 'August', 'September'};
assert(isequal(findMatch(inStr, strList), ''));
q =
logical
1
q =
1×2 logical array
1 0
q =
1×3 logical array
1 0 0
q =
1×4 logical array
1 0 0 1
q =
1×5 logical array
1 0 0 1 1
|
4 | Fail |
inStr = 'fontn';
strList = {'FontName', 'FontUnits', 'FontSize', 'FontWeight'};
assert(isequal(findMatch(inStr, strList), 'FontName'));
q =
logical
1
q =
1×2 logical array
1 1
q =
1×3 logical array
1 1 1
q =
1×4 logical array
1 1 1 1
|
5 | Fail |
inStr = 'weight';
strList = {'FontName', 'FontUnits', 'FontSize', 'FontWeight'};
assert(isequal(findMatch(inStr, strList), 'FontWeight'));
q =
logical
1
q =
1×2 logical array
1 1
q =
1×3 logical array
1 1 1
q =
1×4 logical array
1 1 1 1
|
6 | Fail |
inStr = 'ball';
strList = {'baseball', 'balloon', 'ball'};
assert(isequal(findMatch(inStr, strList), 'ball'));
q =
logical
0
q =
1×2 logical array
0 0
q =
1×3 logical array
0 0 0
|
7 | Fail |
inStr = 'bal';
strList = {'baseball', 'balloon', 'ball'};
assert(isequal(findMatch(inStr, strList), ''));
q =
logical
0
q =
1×2 logical array
0 0
q =
1×3 logical array
0 0 0
|
Find the stride of the longest skip sequence
81 Solvers
Choose the best fitting dominoes
161 Solvers
Create a Multiplication table matrix...
226 Solvers
1014 Solvers
Relative ratio of "1" in binary number
150 Solvers