12345678910111213141516171819202122

class Solution {
    // Function to calculate GCD using Euclid's Algorithm
    gcd(a, b) {
        if (b === 0) {
            return a;  // Base case: if b is 0, return a
        }
        return this.gcd(b, a % b);  // Recursively call GCD with (b, a % b)
    }

    // Function to calculate LCM using the GCD
    calculateLCM(a, b) {
        let g = this.gcd(a, b);  // Calculate GCD of a and b
        return (a * b) / g;  // Calculate LCM using the formula LCM = (a * b) / GCD
    }
}

// Driver code
let a = 4, b = 8;
let obj = new Solution();
let lcm = obj.calculateLCM(a, b);  // Get the LCM
console.log(`The LCM of the two given numbers is ${lcm}`);  // Output the result

Complexity Analysis

Time Complexity: O(logɸ(min(a, b))), where ɸ ≈ 1.61. This is the time complexity of the Euclidean algorithm used to compute the GCD.

Space Complexity: O(1), Only a constant amount of space is used for variables; recursion uses call stack but still considered constant for small inputs.