FindTheDivisors.js

//Create a function named divisors/Divisors that takes an integer n > 1 and returns an array with all of the integer's divisors(except for 1 and the number itself), from smallest to largest. If the number is prime return the string '(integer) is prime' (null in C#) (use Either String a in Haskell and Result<Vec<u32>, String> in Rust).

function divisors(integer) {
    let arr = []
    for(let i=2;i<integer;i++){
      if((integer / i) % 1 === 0 ){
        arr.push(i)
      }
    }
    return arr.join('') === ''?`${integer} is prime`:arr
  };