var gardenNoAdj = function(n, paths) {

var pathMap = Array(n).fill(0).map(() => ({}));

for (var i = 0; i < paths.length; i++) {

pathMap[paths[i][0] - 1][paths[i][1] - 1] = true;

pathMap[paths[i][1] - 1][paths[i][0] - 1] = true;

}

var possibleMap = Array(n).fill(0).map(() => [1,1,1,1]);

var result = Array(n).fill(0);

for (var j = 0; j < n; j++) {

var type = possibleMap[j].findIndex(item => item === 1);

var others = Object.keys(pathMap[j]);

for (var k = 0; k < others.length; k++) {

possibleMap[others[k]][type] = 0;

}

result[j] = type + 1;

}

return result;

};

In the beginning, every garden can plant 4 types of flower.

We go through the gardens, pick one flower type from all passible choices for that garden.

And remove this kind of flower type from the possible types of all neighbor gardens.

In the end, you will have (one of) the result.