c0d3 solved in JS

algo3.js

const solution = (num1, num2, common = [], i = 2) => {
        if (num1 % i === 0 && num2 % i === 0) common.push(i); 
        if (i === num1 || i === num2) return Math.max(...common);
        return solution(num1, num2, common, i + 1);
};