Given an integer n, break it into a sum of at least two positive integers and maximise the product of those parts. Return that maximum product.
A single line containing the integer n.
A single integer: the maximum product achievable.
Example 1
Input
10
Expected
36
Explanation
Breaking 10 into 3 + 3 + 4 gives the product 3*3*4 = 36, which is the largest possible.
Example 2
Input
2
Expected
1
Explanation
The only split of 2 is 1 + 1, whose product is 1.
Ready to solve this?
Sign in to open the editor, run your code against the sample tests, and submit against the full test suite.
Sign in to solve →