Cody

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

Solution 1840848

Submitted on 6 Jun 2019 by Hans Kramer
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   Pass
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))

minsum = 7 minsum = 4 minsum = 0

2   Pass
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))

minsum = 17 minsum = 16 minsum = 14 minsum = 13 minsum = 12 minsum = 11 minsum = 9 minsum = 7 minsum = 5 minsum = 3 minsum = 1 minsum = 0

3   Pass
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))

minsum = 23 minsum = 17 minsum = 13 minsum = 12 minsum = 11 minsum = 8 minsum = 5 minsum = 4 minsum = 3 minsum = 2 minsum = 0

4   Pass
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))

minsum = 24 minsum = 22 minsum = 20 minsum = 18 minsum = 14 minsum = 10 minsum = 8 minsum = 6 minsum = 4 minsum = 3 minsum = 2 minsum = 0