3859. Maximum Product of Two Digits
My accepted Python solution to LeetCode problem 3859, Maximum Product of Two Digits, running in 4ms.
- Difficulty: Easy
- Python
- Runtime 4ms
- Memory 17.4MB
- Updated
Read the problem on LeetCode View on GitHub
The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.
Python
Accepted on LeetCode — runtime 4ms, memory 17.4MB, accepted 2025-12-30.
class Solution:
def maxProduct(self, n: int) -> int:
digits = sorted([int(d) for d in str(n)], reverse=True)
return digits[0] * digits[1]