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 |
list = [1 2; 5 4; 2 4];
order = [1 3 2];
y_correct = 1;
assert(isequal(scoreOrderedDominoes(list, order),y_correct))
score =
0
score =
1
score =
1
|
| 2 | Pass |
list = [1 2; 5 4; 2 4];
order = [2 1 3];
y_correct = 3;
assert(isequal(scoreOrderedDominoes(list, order),y_correct))
score =
3
score =
3
score =
3
|
| 3 | Pass |
list = [1 2; 5 4; 2 4; 1 6; 7 5; 4 5; 4 8];
order = [2 1 3 7 4 6 5];
y_correct = 14;
assert(isequal(scoreOrderedDominoes(list, order),y_correct))
score =
3
score =
3
score =
3
score =
10
score =
12
score =
14
score =
14
|
| 4 | Pass |
list = [1 2; 6 6; 2 4];
order = [2 1 3];
y_correct = 5;
assert(isequal(scoreOrderedDominoes(list, order),y_correct))
score =
5
score =
5
score =
5
|
| 5 | Pass |
list = [1 2; 5 4; 2 4];
order = [1 2 3];
y_correct = 5;
assert(isequal(scoreOrderedDominoes(list, order),y_correct))
score =
3
score =
5
score =
5
|
Remove the small words from a list of words.
441 Solvers
How long is the longest prime diagonal?
261 Solvers
187 Solvers
1125 Solvers
07 - Common functions and indexing 4
249 Solvers