Roadmap DSA Tracker Code Editor Tech Blogs

Loading question...

The ultimate platform to master JavaScript interviews. Comprehensive questions, interactive practice, and detailed explanations.

Explore

Home
Practice Arena
Browse Topics
All Questions

Resources

Learning Roadmap
Cheatsheets
Tech Blog
Community

Stay Updated

Get the latest interview questions and tips delivered to your inbox.

Join 5,000+ developers

© 2026 JS Interview Prep. Made withby developers.

Privacy Terms Cookies

Buy Me A Coffee

Integer Break

Medium

00:00

0 users online

Given a positive integer n, break it into the sum of at least two positive integers to maximize the product.

Sample Input:

Sample Output:

Hints

Hint 1

Use dynamic programming

Hint 2

DP[i] = max(j * (i-j), j * DP[i-j]) for all j < i

Hint 3

Mathematical solution: break into 3s as much as possible

Code Editor

Loading...