From ea33b0bbfbcd43b81f04183c09b7bad61c8cac9c Mon Sep 17 00:00:00 2001
From: Rohit Tanwar <31792358+kriadmin@users.noreply.github.com>
Date: Fri, 29 Dec 2017 16:41:22 +0530
Subject: [PATCH] Update lcm.md

---
 snippets/lcm.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/snippets/lcm.md b/snippets/lcm.md
index 02d984656..9f8085d61 100644
--- a/snippets/lcm.md
+++ b/snippets/lcm.md
@@ -7,7 +7,7 @@ The GCD formula uses recursion.
 
 ```js
 const lcm = (...arr) => {
- arr = [].concat(...arr)
+let data = [].concat(...arr)
 const gcd = (x, y) => (!y ? x : gcd(y, x % y));
 const helperLcm = (x, y) => x * y / gcd(x, y);
 return arr.reduce((a, b) => helperLcm(a, b))