Cody

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

Given a list of ordered pairs, find the order they should be placed in a line, such that the sum of the absolute values of the differences is minimized.

list = [1 2
        5 3
        2 4
order = [1 3 2]
yields: [1 2][2 4][5 3]
    or: abs(2-2) + abs(4-5)
    or:        0 + 1
    or: 1

There is a unique best solution, but the score is NOT always zero.

Solution Stats

63.41% Correct | 36.59% Incorrect
Last solution submitted on Oct 25, 2017

Problem Comments

Solution Comments

Tags

Discover MakerZone

MATLAB and Simulink resources for Arduino, LEGO, and Raspberry Pi

Learn more

Discover what MATLAB® can do for your career.

Opportunities for recent engineering grads.

Apply Today

MATLAB Academy

New to MATLAB?

Learn MATLAB today!