Skip to content

Commit a1fab7a

Browse files
Rod cutting problem added
1 parent 969af66 commit a1fab7a

File tree

1 file changed

+1
-0
lines changed

1 file changed

+1
-0
lines changed

Rod cutting problem/question.txt

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1 @@
1+
Given a rod of length n, and an array that contains the prices of all the pieces smaller than n, determine the maximum profit you could obtain from cutting up the rod and selling its pieces.

0 commit comments

Comments
 (0)