Add solution #1015

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,089 LeetCode solutions in JavaScript
+# 1,090 LeetCode solutions in JavaScript
 
 [https://leetcode.com/](https://leetcode.com/)
 
@@ -823,6 +823,7 @@
 1012|[Numbers With Repeated Digits](./solutions/1012-numbers-with-repeated-digits.js)|Hard|
 1013|[Partition Array Into Three Parts With Equal Sum](./solutions/1013-partition-array-into-three-parts-with-equal-sum.js)|Easy|
 1014|[Best Sightseeing Pair](./solutions/1014-best-sightseeing-pair.js)|Medium|
+1015|[Smallest Integer Divisible by K](./solutions/1015-smallest-integer-divisible-by-k.js)|Medium|
 1022|[Sum of Root To Leaf Binary Numbers](./solutions/1022-sum-of-root-to-leaf-binary-numbers.js)|Easy|
 1023|[Camelcase Matching](./solutions/1023-camelcase-matching.js)|Medium|
 1028|[Recover a Tree From Preorder Traversal](./solutions/1028-recover-a-tree-from-preorder-traversal.js)|Hard|

solutions/1015-smallest-integer-divisible-by-k.js

@@ -0,0 +1,30 @@
+/**
+ * 1015. Smallest Integer Divisible by K
+ * https://leetcode.com/problems/smallest-integer-divisible-by-k/
+ * Difficulty: Medium
+ *
+ * Given a positive integer k, you need to find the length of the smallest positive integer n such
+ * that n is divisible by k, and n only contains the digit 1.
+ *
+ * Return the length of n. If there is no such n, return -1.
+ *
+ * Note: n may not fit in a 64-bit signed integer.
+ */
+
+/**
+ * @param {number} k
+ * @return {number}
+ */
+var smallestRepunitDivByK = function(k) {
+  if (k % 2 === 0 || k % 5 === 0) return -1;
+  let remainder = 0;
+  let length = 1;
+
+  while (length <= k) {
+    remainder = (remainder * 10 + 1) % k;
+    if (remainder === 0) return length;
+    length++;
+  }
+
+  return -1;
+};