Time: 11 ms (53.34%), Space: 17.6 MB (99.16%) - LeetHub

Author: hogan-tech

1015-smallest-integer-divisible-by-k/1015-smallest-integer-divisible-by-k.py

@@ -0,0 +1,22 @@
+# time complexity: O(k)
+# space complexity: O(1)
+class Solution:
+    def smallestRepunitDivByK(self, k: int) -> int:
+        remainder = 0
+        for num in range(1, k+1):
+            remainder = (remainder*10+1) % k
+            if remainder == 0:
+                return num
+        return -1
+
+
+k = 1
+print(Solution().smallestRepunitDivByK(k))
+k = 2
+print(Solution().smallestRepunitDivByK(k))
+k = 3
+print(Solution().smallestRepunitDivByK(k))
+k = 7
+print(Solution().smallestRepunitDivByK(k))
+k = 70
+print(Solution().smallestRepunitDivByK(k))