**Tell us what’s happening:**

Hi. My code runs perfect and it works. So this is not a topic asking for help rather to ask if this implementation by me is considered as a good solution? Do i have good progress here or i am programming with not that efficient way?

**Your code so far**

```
function smallestCommons(arr) {
arr.sort((a,b)=>a-b);
let smallestCommon=1;
let foundIt = true;
let counter = 0;
while(foundIt){
for(let i=arr[0];i<=arr[1];i++){
if(smallestCommon%i==0){
counter++;
}
}
if(counter==(arr[1]-arr[0])+1){
foundIt=false;
console.log(smallestCommon);
}else{
smallestCommon++;
counter=0;
}
}
return smallestCommon;
}
smallestCommons([1,3]);
smallestCommons([1, 13]);
```

```
**Your browser information:**
```

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

.

**Challenge:** Smallest Common Multiple

**Link to the challenge:**