Cody

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

Solution 3360233

Submitted on 24 Oct 2020
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))

k = 4 1 2 2 0 1 0 order = 2 7 5 8 1 6 4 3

Assertion failed.

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

k = 1 1 1 0 8 8 5 order = 1 4 3 6 7 8 2 5

Assertion failed.

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

k = 5 4 2 1 0 1 3 order = 6 8 2 5 3 4 7 1

Assertion failed.

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

k = 5 2 7 5 9 3 4 1 k = 2 2 2 2 2 1 5 2 k = 2 3 2 2 2 1 5 1 k = 3 0 2 3 0 0 2 2 order = 6 9 3 1 5 4 8 2 7

Assertion failed.

Suggested Problems

More from this Author52

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!