Maximum Ribbon Cut
Let's solve the Maximum Ribbon Cut problem using Dynamic Programming.
Statement
Given a ribbon of length n
and a set of possible sizes
, cut the ribbon in sizes
such that n
is achieved with the maximum number of pieces.
You have to return the maximum number of pieces that can make up n
by using any combination of the available sizes
. If the n
can’t be made up, return -1
, and if n
is 0
, return 0
.
Let’s say, we have a ribbon of length and possible sizes as . The ribbon length can be obtained by cutting it into one piece of length and another of length (as ), or, into one piece of length and two pieces of length (as ). As we wish to maximize the number of pieces, we choose the second option, cutting the ribbon into pieces.
Constraints:
-
sizes.length
-
sizes[i]
-
n
Examples
Level up your interview prep. Join Educative to access 80+ hands-on prep courses.