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 =
1×3 logical array
1 0 0
|
2 | Fail |
inStr = 'auG';
strList = {'May', 'June', 'July', 'August', 'September'};
assert(isequal(findMatch(inStr, strList), 'August'));
q =
1×5 logical array
0 0 0 0 0
|
3 | Fail |
inStr = 'Ju';
strList = {'May', 'June', 'July', 'August', 'September'};
assert(isequal(findMatch(inStr, strList), ''));
q =
1×5 logical array
0 1 1 0 0
|
4 | Fail |
inStr = 'fontn';
strList = {'FontName', 'FontUnits', 'FontSize', 'FontWeight'};
assert(isequal(findMatch(inStr, strList), 'FontName'));
q =
1×4 logical array
0 0 0 0
|
5 | Fail |
inStr = 'weight';
strList = {'FontName', 'FontUnits', 'FontSize', 'FontWeight'};
assert(isequal(findMatch(inStr, strList), 'FontWeight'));
q =
1×4 logical array
0 0 0 0
|
6 | Fail |
inStr = 'ball';
strList = {'baseball', 'balloon', 'ball'};
assert(isequal(findMatch(inStr, strList), 'ball'));
q =
1×3 logical array
1 1 1
|
7 | Fail |
inStr = 'bal';
strList = {'baseball', 'balloon', 'ball'};
assert(isequal(findMatch(inStr, strList), ''));
q =
1×3 logical array
1 1 1
|
Given an unsigned integer x, find the largest y by rearranging the bits in x
524 Solvers
Test if a Number is a Palindrome without using any String Operations
157 Solvers
350 Solvers
153 Solvers
889 Solvers