Hi all,
I think I have this challenge done. The code returns same results as requested but I keep on getting an error on the fcc console with higher numbers. Here is my code:
function smallestCommons(arr) {
var order = arr.sort(function(a, b) {
return a - b;
});
var first = order[0];
var last = order[order.length - 1];
var index = 1;
for (var i = first; i < last - 1; i++) {
order.splice(index, 0, i + 1);
index++;
}
var start = last;
function find() {
var counter = 0;
for (var k = 0; k < order.length; k++) {
if (start % order[k] == 0) {
counter++;
}
}
if (counter == order.length) {
return start;
} else {
start++;
return find();
}
}
find();
return start;
}
smallestCommons([23,18]);
I tried with //noprotect and it doesn’t work either.
Could anybody check it out? thanks in advance