LC-2310 Medium LeetCode

2310. Sum of Numbers With Units Digit K

Math Dynamic Programming Greedy Enumeration

Read the full problem statement on LeetCode.

Difficulty: medium Acceptance: 27% Topics: Math, Dynamic Programming, Greedy, Enumeration

Reading material

Math & Geometry 12 min 1-D Dynamic Programming 16 min Greedy 11 min

Reference solution (spoiler · python)

# Time:  O(1)
# Space: O(1)

# math
class Solution(object):
    def minimumNumbers(self, num, k):
        """
        :type num: int
        :type k: int
        :rtype: int
        """
        return next((i for i in xrange(1, (min(num//k, 10) if k else 1)+1) if (num-i*k)%10 == 0), -1) if num else 0

Solution from kamyu104/LeetCode-Solutions · MIT