Linting

snippets/lcm.md

@@ -6,9 +6,9 @@ Use the greatest common divisor (GCD) formula and `Math.abs()` to determine the
 The GCD formula uses recursion.
 
 ```js
-const lcm = (x,y) => {
+const lcm = (x, y) => {
   const gcd = (x, y) => !y ? x : gcd(y, x % y);
-  return Math.abs(x*y)/(gcd(x,y));
+  return Math.abs(x * y) / (gcd(x, y));
 };
 // lcm(12,7) -> 84
 ```