Easy 0 solved 0% acceptance

Spy Number

Check whether the sum of a number's digits equals the product of its digits.

What you'll learn

  • Track a sum and a product in one pass
  • Start a product at 1 and a sum at 0
  • Notice how a 0 digit affects the product

Problem

A spy number is a positive integer whose digit sum equals its digit product. For example, 1124 has sum 1 + 1 + 2 + 4 = 8 and product 1 × 1 × 2 × 4 = 8, so it is a spy number.

Implement spy_number(n).

Input

n: The number to test.

Output

Return true if the sum of the decimal digits of n equals their product, otherwise false. Every single-digit number is a spy number.

Constraints

1 ≤ n ≤ 10^18

Examples

Example 1
Input:
n = 123

Expected output:
expected = True
Input:
long long n = 123;

Expected output:
bool expected = true;
Input:
long n = 123;

Expected output:
bool expected = true;

Explanation

Sum 1 + 2 + 3 = 6 and product 1 × 2 × 3 = 6 are equal, so the answer is true.

Example 2
Input:
n = 1234

Expected output:
expected = False
Input:
long long n = 1234;

Expected output:
bool expected = false;
Input:
long n = 1234;

Expected output:
bool expected = false;

Explanation

Sum 1 + 2 + 3 + 4 = 10 but product 1 × 2 × 3 × 4 = 24, so the answer is false.

How to approach it

Try on your own first, then open one hint at a time.

Hint 1

Walk over the digits once and update both totals.

Hint 2

Start the product at 1, not 0.

Hint 3

Any number containing a 0 digit has product 0, so it cannot be spy unless the sum is 0 too.

Expected complexity

O(d) time for d digits, O(1) extra space

References

This challenge is adapted for CodeUtility. Follow the statement and constraints above.

The best passing solution of each coder. Faster, smaller and better-reviewed solutions rank higher.

No passing solutions yet. Solve it to take first place.

Learn from others

Community solutions

No published solutions yet. Solve this challenge to share the first one.