Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Integer Break
Bookmark
Recursion
Dynamic Programming
Math
Input
n=2
n=4
n=8
n=10
n=12
Custom
n
=
8
n =
8
best =
0
8 units
break 8 into at least two parts, maximize the product
n =
8
best =
0
8 units
break 8 into at least two parts, maximize the product
n =
3
i =
2
best =
2
3 units
pieces
2
1
break 3 into at least two parts, maximize the product
n =
3
i =
2
best =
2
3 units
pieces
2
1
3
=
2
+
1
n =
3
i =
2
best =
4
3 units
break 3 into at least two parts, maximize the product
n =
4
i =
3
best =
4
4 units
pieces
3
1
break 4 into at least two parts, maximize the product
n =
4
i =
1
best =
3
4 units
pieces
1
3
1
x max(
3
, broken =
3
) =
3
n =
3
i =
2
best =
2
3 units
pieces
2
1
2
x max(
1
, broken =
1
) =
2
n =
2
i =
1
best =
0
2 units
break 2 into at least two parts, maximize the product
n =
4
i =
4
best =
0
4 units
break 4 into at least two parts, maximize the product
n =
8
i =
7
best =
18
8 units
Max product =
18
algo
master
.
io
Step:
Start: break 8 into at least two parts with the largest product
0 / 510
Input
n=2
n=4
n=8
n=10
n=12
Custom
n
=
8
0 / 510
algo
master
.
io
Step:
Start: break 8 into at least two parts with the largest product
