Integer Break

MediumMathmath

Solve this the way you would in the interview: out loud, on a timer, with an AI interviewer asking follow-ups while you code. You get a scored report at the end.

Practice this as a mock interviewFree to start, no account needed

Problem

Given an integer n, write it as a sum of **at least two** positive integers and make the product of those integers as large as possible. Return that maximum product. Note that because at least two parts are required, n = 2 must be split as 1 + 1 and n = 3 as 1 + 2.

Examples

Input: n = 2
Output: 1
2 = 1 + 1, product 1.
Input: n = 10
Output: 36
10 = 3 + 3 + 4, product 36.

Constraints

  • 2 <= n <= 58

What the interviewer grades

A correct solution is one of five scores. The report also grades problem understanding (did you clarify inputs and edge cases before coding), problem solving, communication while you work, code quality, and testing. See a sample report, or read up on the pattern in the lessons.

More math problems