add snippet toKebabCase

snippets/gcd.md

@@ -1,16 +1,12 @@
 ### gcd
 
-Calculates the greatest common divisor between two or more numbers numbers.
+Calculates the greatest common divisor between two numbers.
 
-The helper function uses recursion.
-The helper case takes two arguments x and y
+Use recursion.
 Base case is when `y` equals `0`. In this case, return `x`.
 Otherwise, return the GCD of `y` and the remainder of the division `x/y`.
 
 ```js
-const gcd = (...arr) => {
-    const gcdHelper = (x, y) => !y ? x : gcd(y, x % y);
-    return arr.reduce((a,b) => gcdHelper(a,b))
-}
+const gcd = (x, y) => !y ? x : gcd(y, x % y);
 // gcd (8, 36) -> 4
 ```