Find the divisors!

Find the divisors!Codewars

Approach

1. define 'currentNum' with init value input -1 (because we will iterate backward)

2. defined empty array as 'result'

3. iterate while currentNum > 1

   1. if input divide by current num is integer it's divisor add currentNum in result array

   2. decrease curruntNum -1

4. if result has property in other words there is some divisor return result array. if not return ${input} is prime

Solution

JavaScript

const divisors = (integer) => {
  let currentNum = integer - 1;
  const result = [];
  
  while (currentNum > 1) {
    if ((integer / currentNum) % 1 === 0) {
      result.push(integer / currentNum);
    }
    currentNum -= 1;
  }
  
  return result.length ? result : `${integer} is prime`;
};