Package g3601_3700.s3622_check_divisibility_by_digit_sum_and_product

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    3622 - Check Divisibility by Digit Sum and Product.

    Easy

    You are given a positive integer n. Determine whether n is divisible by the sum of the following two values:

    • The digit sum of n (the sum of its digits).

    • The digit product of n (the product of its digits).

    Return true if n is divisible by this sum; otherwise, return false.

    Example 1:

    Input: n = 99

    Output: true

    Explanation:

    Since 99 is divisible by the sum (9 + 9 = 18) plus product (9 \* 9 = 81) of its digits (total 99), the output is true.

    Example 2:

    Input: n = 23

    Output: false

    Explanation:

    Since 23 is not divisible by the sum (2 + 3 = 5) plus product (2 \* 3 = 6) of its digits (total 11), the output is false.

    Constraints:

    • <code>1 <= n <= 10<sup>6</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Boolean checkDivisibility(Integer n)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait