We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Between Two Sets
  5. Discussions

Between Two Sets

  • andreaswilli
     + 1 comment

    JS implementation of this solution:

    function getTotalX(a, b) {
    return [...new Array(Math.floor(gcd(b) / lcm(a)))]
        .map((_, i) => lcm(a) * (i + 1))
        .filter(a => gcd(b) % a === 0)
        .length;
}

function gcd2(a, b) {
    if (!b) return a;
    return gcd2(b, a % b);
}

function lcm2(a, b) {
    return a * b / gcd2(a, b);
}

function gcd(arr) {
    return arr.reduce(gcd2);
}

function lcm(arr) {
    return arr.reduce(lcm2);
}