Add solution #1556

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,364 LeetCode solutions in JavaScript
+# 1,365 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1187,6 +1187,7 @@
 1551|[Minimum Operations to Make Array Equal](./solutions/1551-minimum-operations-to-make-array-equal.js)|Medium|
 1552|[Magnetic Force Between Two Balls](./solutions/1552-magnetic-force-between-two-balls.js)|Medium|
 1553|[Minimum Number of Days to Eat N Oranges](./solutions/1553-minimum-number-of-days-to-eat-n-oranges.js)|Hard|
+1556|[Thousand Separator](./solutions/1556-thousand-separator.js)|Easy|
 1566|[Detect Pattern of Length M Repeated K or More Times](./solutions/1566-detect-pattern-of-length-m-repeated-k-or-more-times.js)|Easy|
 1576|[Replace All ?'s to Avoid Consecutive Repeating Characters](./solutions/1576-replace-all-s-to-avoid-consecutive-repeating-characters.js)|Medium|
 1598|[Crawler Log Folder](./solutions/1598-crawler-log-folder.js)|Easy|

solutions/1556-thousand-separator.js

@@ -0,0 +1,26 @@
+/**
+ * 1556. Thousand Separator
+ * https://leetcode.com/problems/thousand-separator/
+ * Difficulty: Easy
+ *
+ * Given an integer n, add a dot (".") as the thousands separator and return it in string format.
+ */
+
+/**
+ * @param {number} n
+ * @return {string}
+ */
+var thousandSeparator = function(n) {
+  const digits = n.toString().split('');
+  const result = [];
+
+  while (digits.length > 0) {
+    const group = digits.splice(-3).join('');
+    result.unshift(group);
+    if (digits.length > 0) {
+      result.unshift('.');
+    }
+  }
+
+  return result.join('');
+};