**Tell us what’s happening:**

Ok, so I know this code is far from an efficient means to the end for this problem but in theory it should work (and it does for all but the last case). However that last case is giving undefined behavior for the return result, returning seemingly random values. I’m assuming I’ve reached some sort of max iterations issue or something as repl.it does not let me run this either stating potential infinite loop.

My question is am I correct on this assumption? What is the constraint imposed by freecodecamp for iteration count? Is this code absolutely trash?

**Your code so far**

```
function smallestCommons(arr) {
if (arr[0] > arr[1]) {
arr.reverse();
}
var i = arr[0];
var j = arr[1];
var prod = 1;
console.log(arr);
var btwn = [];
for (let k=i; k<=j; k++) {
btwn.push(k);
prod*=k;
}
console.log(btwn,prod);
for (let f=0; f<btwn.length; f++) {
console.log(btwn[f]);
}
for (let d=1; d<=prod; d++) {
for (let f=0; f<btwn.length; f++) {
if (d % btwn[f] != 0) {
d++;
f=0;
}
}
console.log(d);
return d;
}
}
smallestCommons([23,18]);
```

**Your browser information:**

User Agent is: `Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/69.0.3497.100 Safari/537.36`

.

**Link to the challenge:**

https://learn.freecodecamp.org/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/smallest-common-multiple