function solution(n, m) { const gcd = findGcd(n, m); const lcm = n * m / gcd; return [gcd, lcm] } function findGcd(n, m) { if( n % m === 0) { return m; } return findGcd(m, n % m) }