@@ -0,0 +1,399 @@
+# maximum number of combinations of 9 digits is for k=4 or k=5, and it's only 126%0A# so assuming itertools.combinations is implemented efficiently enough, this can be brute-forced%0A%0Afrom itertools import combinations%0A%0Adigits = range(1,10)%0A%0Aclass Solution:%0A    def combinationSum3(self, k: int, n: int) -%3E List%5BList%5Bint%5D%5D:%0A        return %5Bcombo for combo in combinations(digits, k) if sum(combo) == n%5D%0A

216. Combination Sum III