Cody

Problem 492. Find best placement for ordered dominoes (harder)

Solution 1728550

Submitted on 16 Feb 2019 by Abdelfatah Teamah
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 = [4 1 3 4 1 1 5 5 3 5 0 4 2 0]; %2 correct = [2 1 3 7 6 5 4]; assert(isequal(findBestOrderedDominoes(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 findBestOrderedDominoes (line 2) In ScoringEngineTestPoint1 (line 11) In solutionTest (line 3)]

2   Pass
list = [1 1 2 5 7 5 8 1 1 3 7 8 3 6]; %3 correct = [2 6 4 1 5 7 3]; assert(isequal(findBestOrderedDominoes(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 findBestOrderedDominoes (line 2) In ScoringEngineTestPoint2 (line 11) In solutionTest (line 5)]

3   Pass
list = [8 5 3 9 10 6 6 2 2 17 18 14 9 5]; %6 correct = [3 1 2 7 4 5 6]; assert(isequal(findBestOrderedDominoes(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 findBestOrderedDominoes (line 2) In ScoringEngineTestPoint3 (line 11) In solutionTest (line 7)]