Smallest Common Multiple last two bubbles

Smallest Common Multiple last two bubbles
0

#1

The last two bubbles won’t turn green, but I’ve tested and it gives the right answer here I tried using // noprotect. I gives the right answers. but won’t light up.

Your code so far


//noprotect
function smallestCommons(arr) {

var fist = arr[0] 
var ff = fist;
var second = arr[1]
var ss =second;
var numbersbetween = []

if(second > fist){
  var se;

  for(se = second; se > fist;   se--){
    numbersbetween.push(se)
    
  }numbersbetween.push(fist)}
  else{
   
    for( ff = fist; ff > second;   ff--){
   numbersbetween.push(ff) 
    } numbersbetween.push(second)
 }
   
 var bl = numbersbetween.length

  if(numbersbetween[bl-1] === 0){
    
     } document.write(bety  + " ")
  var result = 1;
  var i;
var u= 0;

  for(i = 1;i > 0; i++){   
   u += 1 
    var t =numbersbetween.length;
    var facou = 0;

    for(t > 0; t--;){
      var current = numbersbetween[t]
      var factor = 0;
      if(current == 1){
        
      }
      else{
          factor = u %current;
       facou += factor
      }

    }
    if(facou == 0){
                   var y = i
                  i -= i + 2}

    
  }
 
  return y;
  
}


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/67.0.3396.87 Safari/537.36.

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


#2

I don’t think that //noprotect has been implemented with the new site (the underlying technology of FCC has changed, so many features need to be rebuilt from scratch). My guess is that you are timing out and triggering the infinite loop protection. You can choose to skip the challenge or you can work on a solution that is more efficient. All the lessons can be completed without having to turn the infinite loop protection off.