Cody

# Problem 487. Find perfect placement of non-rotating dominoes (easier)

Solution 2069428

Submitted on 26 Dec 2019
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

### Test Suite

Test Status Code Input and Output
1   Fail
list = [ 1 5 2 1 2 2 3 2 4 8 5 4 5 5 10 3]; correct = [8 4 3 2 1 7 6 5]; assert(isequal(findPerfectOrderedDominoes(list),correct))

Index in position 1 is invalid. Array indices must be positive integers or logical values. Error in findPerfectOrderedDominoes (line 14) pair([count count+1]) = list(order(n),:); Error in Test1 (line 12) assert(isequal(findPerfectOrderedDominoes(list),correct))

2   Fail
list = [ 1 6 2 2 2 7 7 1 7 8 8 10 10 2 10 10]; correct = [5 6 8 7 2 3 4 1]; assert(isequal(findPerfectOrderedDominoes(list),correct))

Index in position 1 is invalid. Array indices must be positive integers or logical values. Error in findPerfectOrderedDominoes (line 14) pair([count count+1]) = list(order(n),:); Error in Test2 (line 12) assert(isequal(findPerfectOrderedDominoes(list),correct))

3   Fail
list = [1 1 1 7 2 4 4 6 5 1 6 2 7 4 7 5]; correct = [8 5 1 2 7 4 6 3]; assert(isequal(findPerfectOrderedDominoes(list),correct))

Index in position 1 is invalid. Array indices must be positive integers or logical values. Error in findPerfectOrderedDominoes (line 14) pair([count count+1]) = list(order(n),:); Error in Test3 (line 12) assert(isequal(findPerfectOrderedDominoes(list),correct))

4   Fail
list = [1 10 3 10 5 3 6 9 7 6 8 7 8 8 9 1 10 5]; correct = [7 6 5 4 8 1 9 3 2]; assert(isequal(findPerfectOrderedDominoes(list),correct))

Index in position 1 is invalid. Array indices must be positive integers or logical values. Error in findPerfectOrderedDominoes (line 14) pair([count count+1]) = list(order(n),:); Error in Test4 (line 13) assert(isequal(findPerfectOrderedDominoes(list),correct))