Subtract the Product and Sum of Digits of an Integer — LeetCode 1281 Python Solution
EasyMath
- Problem
- #1281
- Pattern
- Math and Number Theory
- Reading time
- 2 min
- Source
- leetcode.com
The problem
Given an integer number n, return the difference between the product of its digits and the sum of its digits.
Example
- Input
- n = 234
- Output
- 15
- Explanation
- Product of digits = 2 * 3 * 4 = 24
Python solution
Python
class Solution:
def subtractProductAndSum(self, n: int) -> int:
nums = list(map(int, str(n)))
return prod(nums) - sum(nums)Complexity
| Measure | Complexity |
|---|---|
| Time | O(\log n), where n is the given integer |
| Space | O(1) auxiliary |
Pattern: Math and Number Theory
Find the closed form, the invariant, or the modular identity — and skip the loop entirely. LeetCode 1281. Subtract the Product and Sum of Digits of an Integer is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Math.
The math and number theory guide has the Python template for the pattern and the 485 LeetCode problems that use it.
Related problems
Frequently asked questions
- How hard is LeetCode 1281. Subtract the Product and Sum of Digits of an Integer?
- LeetCode 1281. Subtract the Product and Sum of Digits of an Integer is rated Easy on LeetCode.
- What is the time complexity of LeetCode 1281. Subtract the Product and Sum of Digits of an Integer?
- The Python solution on this page runs in O(\log n), where n is the given integer.
- What is the space complexity of LeetCode 1281. Subtract the Product and Sum of Digits of an Integer?
- The Python solution on this page uses O(1) auxiliary space.
- What topics does LeetCode 1281. Subtract the Product and Sum of Digits of an Integer cover?
- LeetCode 1281. Subtract the Product and Sum of Digits of an Integer is tagged Math on LeetCode.