Always in this series ( 2451, 2484, and 2478 ).
Now we are in color (1 for red and 2 for white). Your task is always to count the minimum number of movements required to align the 3 blocks in each colors (vertically or horizontally).
In this example you can move down the first two blocks ( in two moves ).
Note that blocks can be swapped .
In this second example :
Here you win in only one move by swapping the two central blocks.
Good luck !
Mimic foldl in functional programming
26 Solvers
Project Euler: Problem 3, Largest prime factor
167 Solvers
378 Solvers
Determine Whether an array is empty
561 Solvers
1322 Solvers
Problem Tags