Given an integer n, determine whether n is divisible by the sum of the sum of its digits and the product of its digits.

Return true if n is divisible by this total, and false otherwise.

Constraints:

• $1 \leq$ n $\leq 10^6$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.