Problem · Dynamic Programming
Count Four-Digit Codes with Sum S
Learn this problemProblem statement
Consider all codes made of four digits (0-9). How many of them have a sum of digits equal to S? For example, for S = 4, there are 35 such codes in total. Some of them are 0022, 1003, 1111, 2020, 4000.
Write a function in the editor 👉
that, given an integer S, returns the number of four-digit codes whose sum of digits is equal to S.
Assume that:
Sis an integer within the range[0..36]
In your solution, focus on correctness. The performance of your solution will not be the focus of this assessment.
⊹ ࣪ ﹏𓊝﹏𓂃 𓈒𓏸A heartfelt thanks to Aura Man!~~𓂁﹏⊹ ࣪
Function
googleCountWithSumS(S: int) → intExamples
Example 1
S = 35return = 4The posible code are 9998, 9989, 9899, 8999, The function should return 4 :)
Example 2
S = 4return = 35Google says there is no explanation 😱
Example 3
S = 2return = 10Google expects us to know the explanation by this point 👻
Constraints
S is an integer within the range [0..36].