Add 1015

Author: trung-hn

Readme.md

@@ -192,6 +192,7 @@
 | 994 | Rotting Oranges | Medium | O(N^2) | O(N) | Trees, Recursion | | |
 | 1004 | Max Consecutive Ones III | Medium | O(N) | O(1) | Sliding Window, Two Pointers | | |
 | 1007 | Minimum Domino Rotations For Equal Row | Medium | O(N) | O(1) | Array, Greedy | | |
+| 1015 | Smallest Integer Divisible by K | Medium | O(K) | O(K) | Math | | |
 | 1022 | Sum of Root To Leaf Binary Numbers | Easy | O(N) | O(H) | Tree | | |
 | 1026 | Maximum Difference Between Node and Ancestor | Medium | O(N) | O(H) | Tree, DFS | | |
 | 1029 | Two City Scheduling | Easy | O(NlogN) | O(N) | Greedy | Good Problem | |

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

@@ -0,0 +1,23 @@
+#
+# @lc app=leetcode id=1015 lang=python3
+#
+# [1015] Smallest Integer Divisible by K
+#
+
+# @lc code=start
+# TAGS: Math
+# REVIEWME: Math
+class Solution:
+    # 48 ms, 76.4%. Time: O(K). Space: O(K)
+    def smallestRepunitDivByK(self, K: int) -> int:
+        visited = set()
+        cnt = rem = 0
+        while 1:
+            cnt += 1
+            rem = (rem * 10 + 1) % K
+            if rem in visited: return -1
+            visited.add(rem)
+            if rem == 0: return cnt            
+            
+# @lc code=end
+

testcases/1015

@@ -0,0 +1,26 @@
+1
+2
+3
+4
+5
+6
+7
+8
+9
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
+22
+23
+24
+25
+26