Cody

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

Solution 1918850

Submitted on 2 Sep 2019 by ...
  • Size: 9
  • This is the leading solution.
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Solve This Problem View on Solution Map

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

[Warning: Function assert has the same name as a MATLAB builtin. We suggest you rename the function to avoid a potential name conflict.] [> In unix (line 32) In findPerfectOrderedDominoes (line 4) In ScoringEngineTestPoint1 (line 12) In solutionTest (line 5)]
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))

[Warning: Function assert has the same name as a MATLAB builtin. We suggest you rename the function to avoid a potential name conflict.] [> In unix (line 32) In findPerfectOrderedDominoes (line 4) In ScoringEngineTestPoint2 (line 12) In solutionTest (line 7)]
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))

[Warning: Function assert has the same name as a MATLAB builtin. We suggest you rename the function to avoid a potential name conflict.] [> In unix (line 32) In findPerfectOrderedDominoes (line 4) In ScoringEngineTestPoint3 (line 12) In solutionTest (line 9)]
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))

[Warning: Function assert has the same name as a MATLAB builtin. We suggest you rename the function to avoid a potential name conflict.] [> In unix (line 32) In findPerfectOrderedDominoes (line 4) In ScoringEngineTestPoint4 (line 13) In solutionTest (line 11)]

Suggested Problems

More from this Author52