Tasks Details
medium
1.
PrettyTiling
Given a sequence of squares, find the minimum number of rotations needed to obtain a pretty sequence.
Task Score
100%
Correctness
100%
Performance
100%
Tom is decorating the pavement in his garden with N square tiles. Each tile is divided into four triangles of different colors (white - 'W', red - 'R', green - 'G' and blue - 'B'). A tile is described as a string of four characters denoting respectively, the color of the upper, right, bottom and left triangle. For example, the tile in the figure below is described as "WRGB".
Tom arranged the tiles in a row and decided to rotate some of them to obtain a pretty sequence. He considers a sequence of tiles pretty if each pair of adjacent tiles shares one side of the same color.
Write a function:
function solution(A);
that, given an array A of N strings, representing the sequence of tiles, returns the minimum number of 90-degree rotations (clockwise or counter-clockwise) that Tom has to perform.
Examples:
1. Given A = ["RGBW", "GBRW"], the function should return 1.
Tom can rotate the second tile counter-clockwise once to obtain a pretty sequence.
2. Given A = ["WBGR", "WBGR", "WRGB", "WRGB", "RBGW"], the function should return 4.
Tom can obtain a pretty sequence by rotating the first and third tiles counter-clockwise and the second and fourth tiles clockwise.
3. Given A = ["RBGW", "GBRW", "RWGB", "GBRW"], the function should return 2.
Tom can rotate the first tile clockwise twice to obtain a pretty sequence.
4. Given A = ["GBRW", "RBGW", "BWGR", "BRGW"], the function should return 2.
Tom can rotate the first two tiles clockwise to obtain a pretty sequence.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [1..100,000];
- string representing a tile has 4 letters (exactly one occurrence of 'R', 'G', 'B' and 'W').
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used JavaScript
Time spent on task 52 minutes
Notes
not defined yet
Code: 14:47:39 UTC,
java,
autosave
Code: 14:53:24 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
let rotations = 0;
let mapping = {
RGBW: [1, 0, 1, 1],
GBRW: [1, 1, 0, 1],
WGRB: [1, 1, 1, 0],
RWGB: [0, 1, 1, 1]
};
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
rotations += mapping[tile1]['GBRW'.indexOf(tile2[0])];
}
return rotations;
}
Code: 14:53:31 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
let rotations = 0;
let mapping = {
RGBW: [1, 0, 1, 1],
GBRW: [1, 1, 0, 1],
WGRB: [1, 1, 1, 0],
RWGB: [0, 1, 1, 1]
};
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
rotations += mapping[tile1]['GBRW'.indexOf(tile2[0])];
}
return rotations;
}
Analysis
expand all
Example tests
1.
0.088 s
OK
1.
0.088 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
TypeError: Cannot read property '3' of undefined
at solution (solution.js:15:32)
at solutionWrapper (/tmp/exec_user_zxakj9rq/exec.js:402:28)
at /tmp/exec_user_zxakj9rq/exec.js:428:24
1.
0.084 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
TypeError: Cannot read property '0' of undefined
at solution (solution.js:15:32)
at solutionWrapper (/tmp/exec_user_zxakj9rq/exec.js:402:28)
at /tmp/exec_user_zxakj9rq/exec.js:428:24
1.
0.084 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
TypeError: Cannot read property '1' of undefined
at solution (solution.js:15:32)
at solutionWrapper (/tmp/exec_user_zxakj9rq/exec.js:402:28)
at /tmp/exec_user_zxakj9rq/exec.js:428:24
Code: 14:54:16 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
let rotations = 0;
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
if (tile1[tile1.length - 1] !== tile2[0]) {
rotations++;
}
}
return rotations;
}
Code: 14:54:19 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
let rotations = 0;
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
if (tile1[tile1.length - 1] !== tile2[0]) {
rotations++;
}
}
return rotations;
}
Analysis
expand all
Example tests
1.
0.080 s
OK
1.
0.080 s
OK
1.
0.080 s
WRONG ANSWER,
got 3 expected 2
1.
0.080 s
WRONG ANSWER,
got 3 expected 2
Code: 14:54:58 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
let rotations = 0;
let mapping = {
RGBW: [1, 0, 1, 1],
GBRW: [1, 1, 0, 1],
WGRB: [1, 1, 1, 0],
RWGB: [0, 1, 1, 1]
};
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
if (mapping[tile1]) {
rotations += mapping[tile1]['GBRW'.indexOf(tile2[0])];
} else {
rotations++;
}
}
return rotations;
}
Code: 14:55:05 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
let rotations = 0;
let mapping = {
RGBW: [1, 0, 1, 1],
GBRW: [1, 1, 0, 1],
WGRB: [1, 1, 1, 0],
RWGB: [0, 1, 1, 1]
};
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
if (mapping[tile1]) {
rotations += mapping[tile1]['GBRW'.indexOf(tile2[0])];
} else {
rotations++;
}
}
return rotations;
}
Analysis
expand all
Example tests
1.
0.080 s
OK
1.
0.080 s
OK
1.
0.080 s
WRONG ANSWER,
got 1 expected 2
1.
0.080 s
OK
Code: 14:57:12 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
let rotations = 0;
let mapping = {
RGBW: [1, 0, 1, 1],
GBRW: [1, 1, 0, 1],
WGRB: [1, 1, 1, 0],
RWGB: [0, 1, 1, 1]
};
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
if (mapping[tile1]) {
rotations += mapping[tile1]['GBRW'.indexOf(tile2[0])];
} else {
rotations++;
}
}
return rotations;
}
Code: 14:57:14 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
let rotations = 0;
let mapping = {
RGBW: [1, 0, 1, 1],
GBRW: [1, 1, 0, 1],
WGRB: [1, 1, 1, 0],
RWGB: [0, 1, 1, 1]
};
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
if (mapping[tile1]) {
rotations += mapping[tile1]['GBRW'.indexOf(tile2[0])];
} else {
rotations++;
}
}
return rotations;
}
Analysis
expand all
Example tests
1.
0.088 s
OK
1.
0.084 s
OK
1.
0.084 s
WRONG ANSWER,
got 1 expected 2
1.
0.088 s
OK
Code: 14:57:33 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
let rotations = 0;
let mapping = {
RGBW: [1, 0, 1, 1],
GBRW: [1, 1, 0, 1],
WGRB: [1, 1, 1, 0],
RWGB: [0, 1, 1, 1]
};
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
if (mapping[tile1]) {
rotations += mapping[tile1]['GBRW'.indexOf(tile2[0])];
} else {
rotations++;
}
}
return rotations;
}
Code: 14:57:46 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
let rotations = 0;
let mapping = {
RGBW: [1, 0, 1, 1],
GBRW: [1, 1, 0, 1],
WGRB: [1, 1, 1, 0],
RWGB: [0, 1, 1, 1]
};
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
if (mapping[tile1]) {
rotations += mapping[tile1]['GBRW'.indexOf(tile2[0])];
} else {
rotations++;
}
}
return rotations;
}
Analysis
expand all
Example tests
1.
0.084 s
OK
1.
0.084 s
OK
1.
0.084 s
WRONG ANSWER,
got 1 expected 2
1.
0.088 s
OK
Code: 14:58:05 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
let rotations = 0;
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
// check if the last character of tile1 is different than the first character of tile2
if (tile1[tile1.length - 1] !== tile2[0]) {
// increment the number of rotations
rotations++;
}
}
return rotations;
}
Code: 14:58:07 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
let rotations = 0;
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
// check if the last character of tile1 is different than the first character of tile2
if (tile1[tile1.length - 1] !== tile2[0]) {
// increment the number of rotations
rotations++;
}
}
return rotations;
}
Analysis
expand all
Example tests
1.
0.080 s
OK
1.
0.080 s
OK
1.
0.080 s
WRONG ANSWER,
got 3 expected 2
1.
0.080 s
WRONG ANSWER,
got 3 expected 2
Code: 14:59:05 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
let rotations = 0;
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
// check the last character of tile1 with all four characters of tile2
// and increment the number of rotations as required
if (tile1[tile1.length - 1] !== tile2[0]) rotations++;
else if (tile1[tile1.length - 1] !== tile2[1]) rotations++;
else if (tile1[tile1.length - 1] !== tile2[2]) rotations++;
else if (tile1[tile1.length - 1] !== tile2[3]) rotations++;
}
return rotations;
}
Code: 14:59:07 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
let rotations = 0;
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
// check the last character of tile1 with all four characters of tile2
// and increment the number of rotations as required
if (tile1[tile1.length - 1] !== tile2[0]) rotations++;
else if (tile1[tile1.length - 1] !== tile2[1]) rotations++;
else if (tile1[tile1.length - 1] !== tile2[2]) rotations++;
else if (tile1[tile1.length - 1] !== tile2[3]) rotations++;
}
return rotations;
}
Analysis
expand all
Example tests
1.
0.080 s
OK
1.
0.080 s
OK
1.
0.080 s
WRONG ANSWER,
got 3 expected 2
1.
0.080 s
WRONG ANSWER,
got 3 expected 2
Code: 15:01:40 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
let rotations = 0;
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
let count = 0;
while (tile1[tile1.length - 1] !== tile2[0]) {
tile2 = tile2[3] + tile2.slice(0, 3);
count++;
}
rotations += count;
}
return rotations;
}
Code: 15:01:42 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
let rotations = 0;
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
let count = 0;
while (tile1[tile1.length - 1] !== tile2[0]) {
tile2 = tile2[3] + tile2.slice(0, 3);
count++;
}
rotations += count;
}
return rotations;
}
Analysis
expand all
Example tests
1.
0.080 s
OK
1.
0.080 s
WRONG ANSWER,
got 8 expected 4
1.
0.080 s
WRONG ANSWER,
got 7 expected 2
1.
0.080 s
WRONG ANSWER,
got 7 expected 2
Code: 15:02:43 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
let rotations = 0;
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
// check the last character of tile1 with all four characters of tile2
// and increment the number of rotations as required
while (tile1[tile1.length - 1] !== tile2[0]) {
tile2 = tile2[3] + tile2.slice(0, 3);
rotations++;
}
}
return rotations;
}
Code: 15:03:57 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
let rotations = 0;
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
// check the last character of tile1 with all four characters of tile2
// and increment the number of rotations as required
while (tile1[tile1.length - 1] !== tile2[0]) {
tile2 = tile2[3] + tile2.slice(0, 3);
rotations++;
}
}
return rotations;
}
Analysis
expand all
Example tests
1.
0.112 s
OK
1.
0.124 s
WRONG ANSWER,
got 8 expected 4
1.
0.128 s
WRONG ANSWER,
got 7 expected 2
1.
0.144 s
WRONG ANSWER,
got 7 expected 2
Code: 15:11:09 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
let rotations = 0;
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
// check the last character of tile1 with all four characters of tile2
// and increment the number of rotations as required
while (tile1[tile1.length - 1] !== tile2[0]) {
tile2 = tile2[3] + tile2.slice(0, 3);
rotations++;
}
}
return rotations;
}
Code: 15:11:19 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
for ()
let rotations = 0;
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
// check the last character of tile1 with all four characters of tile2
// and increment the number of rotations as required
while (tile1[tile1.length - 1] !== tile2[0]) {
tile2 = tile2[3] + tile2.slice(0, 3);
rotations++;
}
}
return rotations;
}
Code: 15:11:29 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
// check the last character of tile1 with all four characters of tile2
// and increment the number of rotations as required
while (tile1[tile1.length - 1] !== tile2[0]) {
tile2 = tile2[3] + tile2.slice(0, 3);
rotations++;
}
}
let rotations = 0;
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
// check the last character of tile1 with all four characters of tile2
// and increment the number of rotations as required
while (tile1[tile1.length - 1] !== tile2[0]) {
tile2 = tile2[3] + tile2.slice(0, 3);
rotations++;
}
}
return rotations;
}
Code: 15:11:46 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
// check the last character of tile1 with all four characters of tile2
// and increment the number of rotations as required
while (tile1[tile1.length - 1] !== tile2[0]) {
tile2 = tile2[3] + tile2.slice(0, 3);
rotations++;
}
}
let rotations = 0;
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
// check the last character of tile1 with all four characters of tile2
// and increment the number of rotations as required
while (tile1[tile1.length - 1] !== tile2[0]) {
tile2 = tile2[3] + tile2.slice(0, 3);
rotations++;
}
}
return rotations;
}
Code: 15:12:01 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const candidates = {
"WBGR": []
}
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
// check the last character of tile1 with all four characters of tile2
// and increment the number of rotations as required
while (tile1[tile1.length - 1] !== tile2[0]) {
tile2 = tile2[3] + tile2.slice(0, 3);
rotations++;
}
}
let rotations = 0;
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
// check the last character of tile1 with all four characters of tile2
// and increment the number of rotations as required
while (tile1[tile1.length - 1] !== tile2[0]) {
tile2 = tile2[3] + tile2.slice(0, 3);
rotations++;
}
}
return rotations;
}
Code: 15:12:24 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const candidates = {
"WBGR": 0,
"WBGR": 0,
}
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
// check the last character of tile1 with all four characters of tile2
// and increment the number of rotations as required
while (tile1[tile1.length - 1] !== tile2[0]) {
tile2 = tile2[3] + tile2.slice(0, 3);
rotations++;
}
}
let rotations = 0;
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
// check the last character of tile1 with all four characters of tile2
// and increment the number of rotations as required
while (tile1[tile1.length - 1] !== tile2[0]) {
tile2 = tile2[3] + tile2.slice(0, 3);
rotations++;
}
}
return rotations;
}
Code: 15:12:53 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const candidates = {
"W": 0,
"R": 0,
"G": 0,
"B": 0,
};
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
// check the last character of tile1 with all four characters of tile2
// and increment the number of rotations as required
while (tile1[tile1.length - 1] !== tile2[0]) {
tile2 = tile2[3] + tile2.slice(0, 3);
rotations++;
}
}
let rotations = 0;
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
// check the last character of tile1 with all four characters of tile2
// and increment the number of rotations as required
while (tile1[tile1.length - 1] !== tile2[0]) {
tile2 = tile2[3] + tile2.slice(0, 3);
rotations++;
}
}
return rotations;
}
Code: 15:13:10 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const candidates = {
"W": 0,
"R": 0,
"G": 0,
"B": 0,
};
let result = Number.POSITIVE_INFINITY;
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
// check the last character of tile1 with all four characters of tile2
// and increment the number of rotations as required
while (tile1[tile1.length - 1] !== tile2[0]) {
tile2 = tile2[3] + tile2.slice(0, 3);
rotations++;
}
}
let rotations = 0;
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
// check the last character of tile1 with all four characters of tile2
// and increment the number of rotations as required
while (tile1[tile1.length - 1] !== tile2[0]) {
tile2 = tile2[3] + tile2.slice(0, 3);
rotations++;
}
}
return rotations;
}
Code: 15:13:39 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const colors = ["W", "R", "G", "B"];
let result = Number.POSITIVE_INFINITY;
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
// check the last character of tile1 with all four characters of tile2
// and increment the number of rotations as required
while (tile1[tile1.length - 1] !== tile2[0]) {
tile2 = tile2[3] + tile2.slice(0, 3);
rotations++;
}
}
let rotations = 0;
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
// check the last character of tile1 with all four characters of tile2
// and increment the number of rotations as required
while (tile1[tile1.length - 1] !== tile2[0]) {
tile2 = tile2[3] + tile2.slice(0, 3);
rotations++;
}
}
return rotations;
}
Code: 15:17:38 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const colors = ["W", "R", "G", "B"];
let result = Number.POSITIVE_INFINITY;
f
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
// check the last character of tile1 with all four characters of tile2
// and increment the number of rotations as required
while (tile1[tile1.length - 1] !== tile2[0]) {
tile2 = tile2[3] + tile2.slice(0, 3);
rotations++;
}
}
let rotations = 0;
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
// check the last character of tile1 with all four characters of tile2
// and increment the number of rotations as required
while (tile1[tile1.length - 1] !== tile2[0]) {
tile2 = tile2[3] + tile2.slice(0, 3);
rotations++;
}
}
return rotations;
}
Code: 15:17:57 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const colors = ["W", "R", "G", "B"];
let result = Number.POSITIVE_INFINITY;
for (const first of colors) {
}
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
// check the last character of tile1 with all four characters of tile2
// and increment the number of rotations as required
while (tile1[tile1.length - 1] !== tile2[0]) {
tile2 = tile2[3] + tile2.slice(0, 3);
rotations++;
}
}
let rotations = 0;
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
// check the last character of tile1 with all four characters of tile2
// and increment the number of rotations as required
while (tile1[tile1.length - 1] !== tile2[0]) {
tile2 = tile2[3] + tile2.slice(0, 3);
rotations++;
}
}
return rotations;
}
Code: 15:18:12 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const colors = ["W", "R", "G", "B"];
let result = Number.POSITIVE_INFINITY;
const iLeft =
for (const first of colors) {
}
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
// check the last character of tile1 with all four characters of tile2
// and increment the number of rotations as required
while (tile1[tile1.length - 1] !== tile2[0]) {
tile2 = tile2[3] + tile2.slice(0, 3);
rotations++;
}
}
let rotations = 0;
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
// check the last character of tile1 with all four characters of tile2
// and increment the number of rotations as required
while (tile1[tile1.length - 1] !== tile2[0]) {
tile2 = tile2[3] + tile2.slice(0, 3);
rotations++;
}
}
return rotations;
}
Code: 15:18:28 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const colors = ["W", "R", "G", "B"];
let result = Number.POSITIVE_INFINITY;
const iLeft = 3;
const iRight =
for (const first of colors) {
}
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
// check the last character of tile1 with all four characters of tile2
// and increment the number of rotations as required
while (tile1[tile1.length - 1] !== tile2[0]) {
tile2 = tile2[3] + tile2.slice(0, 3);
rotations++;
}
}
let rotations = 0;
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
// check the last character of tile1 with all four characters of tile2
// and increment the number of rotations as required
while (tile1[tile1.length - 1] !== tile2[0]) {
tile2 = tile2[3] + tile2.slice(0, 3);
rotations++;
}
}
return rotations;
}
Code: 15:18:39 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const colors = ["W", "R", "G", "B"];
let result = Number.POSITIVE_INFINITY;
const iLeft = 3;
const iRight = 1;
for (const first of colors) {
}
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
// check the last character of tile1 with all four characters of tile2
// and increment the number of rotations as required
while (tile1[tile1.length - 1] !== tile2[0]) {
tile2 = tile2[3] + tile2.slice(0, 3);
rotations++;
}
}
let rotations = 0;
for (let i = 0; i < A.length - 1; i++) {
let tile1 = A[i];
let tile2 = A[i + 1];
// check the last character of tile1 with all four characters of tile2
// and increment the number of rotations as required
while (tile1[tile1.length - 1] !== tile2[0]) {
tile2 = tile2[3] + tile2.slice(0, 3);
rotations++;
}
}
return rotations;
}
Code: 15:30:10 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const colors = ['W', 'R', 'G', 'B'];
const iLeft = 3;
const iRight = 1;
let result = Number.POSITIVE_INFINITY;
/**
* Rotations needed to get the color at this index to be the left one (3).
*/
const PRECALCR = {
0: 1,
1: 2,
2: 1,
3: 0,
}
const OPPOSITE = {
0: 2,
1: 3,
2: 0,
3: 1,
};
for (const firstC of colors) {
let candidate = 0;
lastC = firstC;
for (let i = 0; i < A.length; i++) {
const tile = A[i];
const iC = tile.indexOf(lastC);
const lastC = OPPOSITE[iC];
const rotationsNeeded = PRECALCR[iC];
candidate += rotationsNeeded;
}
if (candidate < result) {
result = candidate;
}
}
return result;
}
Code: 15:30:20 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const colors = ['W', 'R', 'G', 'B'];
const iLeft = 3;
const iRight = 1;
let result = Number.POSITIVE_INFINITY;
/**
* Rotations needed to get the color at this index to be the left one (3).
*/
const PRECALCR = {
0: 1,
1: 2,
2: 1,
3: 0,
}
const OPPOSITE = {
0: 2,
1: 3,
2: 0,
3: 1,
};
for (const firstC of colors) {
let candidate = 0;
lastC = firstC;
for (let i = 0; i < A.length; i++) {
const tile = A[i];
const iC = tile.indexOf(lastC);
const lastC = OPPOSITE[iC];
const rotationsNeeded = PRECALCR[iC];
candidate += rotationsNeeded;
}
if (candidate < result) {
result = candidate;
}
}
return result;
}
Code: 15:30:30 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const colors = ['W', 'R', 'G', 'B'];
let result = Number.POSITIVE_INFINITY;
/**
* Rotations needed to get the color at this index to be the left one (3).
*/
const PRECALCR = {
0: 1,
1: 2,
2: 1,
3: 0,
}
const OPPOSITE = {
0: 2,
1: 3,
2: 0,
3: 1,
};
for (const firstC of colors) {
let candidate = 0;
lastC = firstC;
for (let i = 0; i < A.length; i++) {
const tile = A[i];
const iC = tile.indexOf(lastC);
const lastC = OPPOSITE[iC];
const rotationsNeeded = PRECALCR[iC];
candidate += rotationsNeeded;
}
if (candidate < result) {
result = candidate;
}
}
return result;
}
Analysis
expand all
Example tests
1.
0.080 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: Cannot access 'lastC' before initialization
at solution (solution.js:31:31)
at solutionWrapper (/tmp/exec_user_4a7e4doh/exec.js:402:28)
at /tmp/exec_user_4a7e4doh/exec.js:428:24
1.
0.080 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: Cannot access 'lastC' before initialization
at solution (solution.js:31:31)
at solutionWrapper (/tmp/exec_user_4a7e4doh/exec.js:402:28)
at /tmp/exec_user_4a7e4doh/exec.js:428:24
1.
0.080 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: Cannot access 'lastC' before initialization
at solution (solution.js:31:31)
at solutionWrapper (/tmp/exec_user_4a7e4doh/exec.js:402:28)
at /tmp/exec_user_4a7e4doh/exec.js:428:24
1.
0.080 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: Cannot access 'lastC' before initialization
at solution (solution.js:31:31)
at solutionWrapper (/tmp/exec_user_4a7e4doh/exec.js:402:28)
at /tmp/exec_user_4a7e4doh/exec.js:428:24
Code: 15:30:41 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const colors = ['W', 'R', 'G', 'B'];
let result = Number.POSITIVE_INFINITY;
/**
* Rotations needed to get the color at this index to be the left one (3).
*/
const PRECALCR = {
0: 1,
1: 2,
2: 1,
3: 0,
}
const OPPOSITE = {
0: 2,
1: 3,
2: 0,
3: 1,
};
for (const firstC of colors) {
let candidate = 0;
lastC = firstC;
for (let i = 0; i < A.length; i++) {
const tile = A[i];
const iC = tile.indexOf(lastC);
const lastC = OPPOSITE[iC];
const rotationsNeeded = PRECALCR[iC];
candidate += rotationsNeeded;
}
if (candidate < result) {
result = candidate;
}
}
return result;
}
Code: 15:30:54 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const colors = ['W', 'R', 'G', 'B'];
let result = Number.POSITIVE_INFINITY;
/**
* Rotations needed to get the color at this index to be the left one (3).
*/
const PRECALCR = {
0: 1,
1: 2,
2: 1,
3: 0,
}
const OPPOSITE = {
0: 2,
1: 3,
2: 0,
3: 1,
};
for (const firstC of colors) {
let candidate = 0;
let lastC = firstC;
for (let i = 0; i < A.length; i++) {
const tile = A[i];
const iC = tile.indexOf(lastC);
const lastC = OPPOSITE[iC];
const rotationsNeeded = PRECALCR[iC];
candidate += rotationsNeeded;
}
if (candidate < result) {
result = candidate;
}
}
return result;
}
Analysis
expand all
Example tests
1.
0.144 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: Cannot access 'lastC' before initialization
at solution (solution.js:30:31)
at solutionWrapper (/tmp/exec_user_hndstf2l/exec.js:402:28)
at /tmp/exec_user_hndstf2l/exec.js:428:24
1.
0.136 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: Cannot access 'lastC' before initialization
at solution (solution.js:30:31)
at solutionWrapper (/tmp/exec_user_hndstf2l/exec.js:402:28)
at /tmp/exec_user_hndstf2l/exec.js:428:24
1.
0.144 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: Cannot access 'lastC' before initialization
at solution (solution.js:30:31)
at solutionWrapper (/tmp/exec_user_hndstf2l/exec.js:402:28)
at /tmp/exec_user_hndstf2l/exec.js:428:24
1.
0.088 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: Cannot access 'lastC' before initialization
at solution (solution.js:30:31)
at solutionWrapper (/tmp/exec_user_hndstf2l/exec.js:402:28)
at /tmp/exec_user_hndstf2l/exec.js:428:24
Code: 15:31:34 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const colors = ['W', 'R', 'G', 'B'];
const iLeft = 3;
const iRight = 1;
let result = Number.POSITIVE_INFINITY;
/**
* Rotations needed to get the color at this index to be the left one (3).
*/
const PRECALCR = {
0: 1,
1: 2,
2: 1,
3: 0,
}
const OPPOSITE = {
0: 2,
1: 3,
2: 0,
3: 1,
};
for (const firstC of colors) {
let candidate = 0;
let lastC = firstC;
for (let i = 0; i < A.length; i++) {
const tile = A[i];
const iC = tile.indexOf(lastC);
const rotationsNeeded = PRECALCR[iC];
lastC = OPPOSITE[iC];
candidate += rotationsNeeded;
}
if (candidate < result) {
result = candidate;
}
}
return result;
}
return result;
}
Code: 15:31:36 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const colors = ['W', 'R', 'G', 'B'];
const iLeft = 3;
const iRight = 1;
let result = Number.POSITIVE_INFINITY;
/**
* Rotations needed to get the color at this index to be the left one (3).
*/
const PRECALCR = {
0: 1,
1: 2,
2: 1,
3: 0,
}
const OPPOSITE = {
0: 2,
1: 3,
2: 0,
3: 1,
};
for (const firstC of colors) {
let candidate = 0;
let lastC = firstC;
for (let i = 0; i < A.length; i++) {
const tile = A[i];
const iC = tile.indexOf(lastC);
const rotationsNeeded = PRECALCR[iC];
lastC = OPPOSITE[iC];
candidate += rotationsNeeded;
}
if (candidate < result) {
result = candidate;
}
}
return result;
}
return result;
}
Analysis
expand all
Example tests
1.
0.080 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
solution.js:53
}();
^
SyntaxError: Unexpected token ';'
at new Script (vm.js:102:7)
at createScript (vm.js:262:10)
at Object.runInNewContext (vm.js:303:10)
at getSolution (/tmp/exec_user_f39ulakw/exec.js:392:29)
at /tmp/exec_user_f39ulakw/exec.js:426:34
1.
0.080 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
solution.js:53
}();
^
SyntaxError: Unexpected token ';'
at new Script (vm.js:102:7)
at createScript (vm.js:262:10)
at Object.runInNewContext (vm.js:303:10)
at getSolution (/tmp/exec_user_f39ulakw/exec.js:392:29)
at /tmp/exec_user_f39ulakw/exec.js:426:34
1.
0.084 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
solution.js:53
}();
^
SyntaxError: Unexpected token ';'
at new Script (vm.js:102:7)
at createScript (vm.js:262:10)
at Object.runInNewContext (vm.js:303:10)
at getSolution (/tmp/exec_user_f39ulakw/exec.js:392:29)
at /tmp/exec_user_f39ulakw/exec.js:426:34
1.
0.080 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
solution.js:53
}();
^
SyntaxError: Unexpected token ';'
at new Script (vm.js:102:7)
at createScript (vm.js:262:10)
at Object.runInNewContext (vm.js:303:10)
at getSolution (/tmp/exec_user_f39ulakw/exec.js:392:29)
at /tmp/exec_user_f39ulakw/exec.js:426:34
Code: 15:31:51 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const colors = ['W', 'R', 'G', 'B'];
const iLeft = 3;
const iRight = 1;
let result = Number.POSITIVE_INFINITY;
/**
* Rotations needed to get the color at this index to be the left one (3).
*/
const PRECALCR = {
0: 1,
1: 2,
2: 1,
3: 0,
}
const OPPOSITE = {
0: 2,
1: 3,
2: 0,
3: 1,
};
for (const firstC of colors) {
let candidate = 0;
let lastC = firstC;
for (let i = 0; i < A.length; i++) {
const tile = A[i];
const iC = tile.indexOf(lastC);
const rotationsNeeded = PRECALCR[iC];
lastC = OPPOSITE[iC];
candidate += rotationsNeeded;
}
if (candidate < result) {
result = candidate;
}
}
return result;
}
Analysis
expand all
Example tests
1.
0.080 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, non-integer number found
1.
0.080 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, non-integer number found
1.
0.076 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, non-integer number found
1.
0.080 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, non-integer number found
Code: 15:32:15 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const colors = ['W', 'R', 'G', 'B'];
let result = Number.POSITIVE_INFINITY;
/**
* Rotations needed to get the color at this index to be the left one (3).
*/
const PRECALCR = {
0: 1,
1: 2,
2: 1,
3: 0,
}
const OPPOSITE = {
0: 2,
1: 3,
2: 0,
3: 1,
};
for (const firstC of colors) {
let candidate = 0;
let lastC = firstC;
for (let i = 0; i < A.length; i++) {
const tile = A[i];
const iC = tile.indexOf(lastC);
const rotationsNeeded = PRECALCR[iC];
lastC = OPPOSITE[iC];
candidate += rotationsNeeded;
}
if (candidate < result) {
result = candidate;
}
}
return result;
}
Code: 15:37:20 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const colors = ['W', 'R', 'G', 'B'];
let result = Number.POSITIVE_INFINITY;
/** Rotations needed to get the color at this index to be the left one (3). */
const PRECALCR = { 0: 1, 1: 2, 2: 1, 3: 0 };
const OPPOSITE = { 0: 2, 1: 3, 2: 0, 3: 1 };
for (const firstC of colors) {
let candidate = 0;
let lastC = firstC;
for (let i = 0; i < A.length; i++) {
const tile = A[i];
const iC = tile.indexOf(lastC);
const rotationsNeeded = PRECALCR[iC];
lastC = tile[OPPOSITE[iC]];
candidate += rotationsNeeded;
}
if (candidate < result) {
result = candidate;
}
}
return result;
}
Code: 15:37:21 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const colors = ['W', 'R', 'G', 'B'];
let result = Number.POSITIVE_INFINITY;
/** Rotations needed to get the color at this index to be the left one (3). */
const PRECALCR = { 0: 1, 1: 2, 2: 1, 3: 0 };
const OPPOSITE = { 0: 2, 1: 3, 2: 0, 3: 1 };
for (const firstC of colors) {
let candidate = 0;
let lastC = firstC;
for (let i = 0; i < A.length; i++) {
const tile = A[i];
const iC = tile.indexOf(lastC);
const rotationsNeeded = PRECALCR[iC];
lastC = tile[OPPOSITE[iC]];
candidate += rotationsNeeded;
}
if (candidate < result) {
result = candidate;
}
}
return result;
}
Analysis
Code: 15:39:07 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const colors = ['W', 'R', 'G', 'B'];
let result = Number.POSITIVE_INFINITY;
/** Rotations needed to get the color at this index to be the left one (3). */
const PRECALCR = { 0: 1, 1: 2, 2: 1, 3: 0 };
const OPPOSITE = { 0: 2, 1: 3, 2: 0, 3: 1 };
for (const firstC of colors) {
let candidate = 0;
let lastC = firstC;
for (let i = 0; i < A.length; i++) {
const tile = A[i];
const iC = tile.indexOf(lastC);
const rotationsNeeded = PRECALCR[iC];
lastC = tile[OPPOSITE[iC]];
candidate += rotationsNeeded;
}
if (candidate < result) {
result = candidate;
}
}
return result;
}
Code: 15:39:15 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const colors = ['W', 'R', 'G', 'B'];
let result = Number.POSITIVE_INFINITY;
/** Rotations needed to get the color at this index to be the left one (3). */
const PRECALCR = { 0: 1, 1: 2, 2: 1, 3: 0 };
const OPPOSITE = { 0: 2, 1: 3, 2: 0, 3: 1 };
for (const firstC of colors) {
let candidate = 0;
let lastC = firstC;
for (let i = 0; i < A.length; i++) {
const tile = A[i];
const iC = tile.indexOf(lastC);
const rotationsNeeded = PRECALCR[iC];
lastC = tile[OPPOSITE[iC]];
candidate += rotationsNeeded;
}
if (candidate < result) {
result = candidate;
}
}
return result;
}
Code: 15:39:17 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const colors = ['W', 'R', 'G', 'B'];
let result = Number.POSITIVE_INFINITY;
/** Rotations needed to get the color at this index to be the left one (3). */
const PRECALCR = { 0: 1, 1: 2, 2: 1, 3: 0 };
const OPPOSITE = { 0: 2, 1: 3, 2: 0, 3: 1 };
for (const firstC of colors) {
let candidate = 0;
let lastC = firstC;
for (let i = 0; i < A.length; i++) {
const tile = A[i];
const iC = tile.indexOf(lastC);
const rotationsNeeded = PRECALCR[iC];
lastC = tile[OPPOSITE[iC]];
candidate += rotationsNeeded;
}
if (candidate < result) {
result = candidate;
}
}
return result;
}
Analysis
Code: 15:39:24 UTC,
js,
final,
score:
100
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const colors = ['W', 'R', 'G', 'B'];
let result = Number.POSITIVE_INFINITY;
/** Rotations needed to get the color at this index to be the left one (3). */
const PRECALCR = { 0: 1, 1: 2, 2: 1, 3: 0 };
const OPPOSITE = { 0: 2, 1: 3, 2: 0, 3: 1 };
for (const firstC of colors) {
let candidate = 0;
let lastC = firstC;
for (let i = 0; i < A.length; i++) {
const tile = A[i];
const iC = tile.indexOf(lastC);
const rotationsNeeded = PRECALCR[iC];
lastC = tile[OPPOSITE[iC]];
candidate += rotationsNeeded;
}
if (candidate < result) {
result = candidate;
}
}
return result;
}
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N)
expand all
Correctness tests
1.
0.080 s
OK
2.
0.080 s
OK
1.
0.080 s
OK
2.
0.080 s
OK
3.
0.080 s
OK
4.
0.080 s
OK
5.
0.080 s
OK
1.
0.080 s
OK
2.
0.080 s
OK
3.
0.080 s
OK
4.
0.080 s
OK
5.
0.080 s
OK
1.
0.080 s
OK
2.
0.080 s
OK
expand all
Correctness/performance tests
1.
0.080 s
OK
2.
0.080 s
OK
3.
0.080 s
OK
4.
0.080 s
OK
5.
0.080 s
OK
1.
0.084 s
OK
2.
0.080 s
OK
3.
0.080 s
OK
4.
0.080 s
OK
5.
0.080 s
OK
6.
0.080 s
OK
1.
0.080 s
OK
2.
0.080 s
OK
3.
0.080 s
OK
expand all
Performance tests
1.
0.208 s
OK
2.
0.204 s
OK
3.
0.212 s
OK
4.
0.208 s
OK
5.
0.204 s
OK
6.
0.208 s
OK
7.
0.208 s
OK
1.
0.212 s
OK
2.
0.208 s
OK
3.
0.204 s
OK
4.
0.204 s
OK
1.
0.208 s
OK
2.
0.204 s
OK
3.
0.204 s
OK
4.
0.212 s
OK
5.
0.204 s
OK
1.
0.204 s
OK
2.
0.204 s
OK
3.
0.200 s
OK