Is Maximum Product of Two Digits easy or hard?

Maximum Product of Two Digits is categorized as an Easy problem. The main idea is recognizing that the maximum product must come from the two largest digits, which can be found with a simple linear scan.

Maximum Product of Two Digits Python/Java solution

In both Python and Java, extract digits using modulo (n % 10) and integer division. Maintain two variables representing the largest and second-largest digits. After iterating through all digits, return their product.

How to solve Maximum Product of Two Digits in O(n)?

Treat n as the number of digits. Extract digits using modulo and division operations, and maintain two variables for the largest and second-largest digits. Update them during a single pass through the digits, then multiply them to get the maximum product.

What is the best approach for Maximum Product of Two Digits?

The best approach is scanning the digits once while tracking the largest and second-largest digits. Each digit is processed using simple comparisons, and the final answer is their product. This method runs in O(d) time and uses O(1) extra space.

Is Maximum Product of Two Digits asked at Google/Amazon/Meta?

This style of digit-processing problem commonly appears in screening rounds and coding assessments at large tech companies. Variations involving extracting digits, tracking extremes, or computing digit-based metrics are frequently used to test basic algorithmic reasoning.

What data structure is used in Maximum Product of Two Digits?

The optimal solution does not require a complex data structure. It relies on simple integer variables to track the two largest digits while iterating through the number. Some alternative solutions temporarily store digits in an array for sorting.

What is the time complexity of Maximum Product of Two Digits?

The optimal solution runs in O(d) time, where d is the number of digits in the integer. Each digit is processed exactly once while maintaining the two largest values. Space complexity remains O(1) because only two variables are stored.

Description Hints 1 Solution Video 2:53

3536. Maximum Product of Two Digits

Easy75.7% acceptance1 company

You are given a positive integer n.

Return the maximum product of any two digits in n.

Note: You may use the same digit twice if it appears more than once in n.

Example 1:

Input: n = 31

Output: 3

Explanation:

The digits of n are [3, 1].
The possible products of any two digits are: 3 * 1 = 3.
The maximum product is 3.

Example 2:

Input: n = 22

Output: 4

Explanation:

The digits of n are [2, 2].
The possible products of any two digits are: 2 * 2 = 4.
The maximum product is 4.

Example 3:

Input: n = 124

Output: 8

Explanation:

The digits of n are [1, 2, 4].
The possible products of any two digits are: 1 * 2 = 2, 1 * 4 = 4, 2 * 4 = 8.
The maximum product is 8.

Constraints:

10 <= n <= 10⁹

Asked at 1 company

Google

Topics

Math Sorting

Hints open one at a time

Hint 1

Use brute force

2:53

Still stuck?Read the written solution, or watch a walkthrough.

Open solution

LanguageLoading editor…

1class Solution:
2    def maxProduct(self, n: int) -> int:
3        

Starter codePython 3Spaces: 4

Examples

Case 1Case 2Case 3

Input

Your code is saved on this device.Solution