29 - Rod Cutting - Dynamic Programming approach
@Rishi Srivastava
Pseudo code:
Let cutRod(n) be the required best possible price value for a rod of length n.
cutRod(n) = max(price[i] cutRod(n-i-1)) for all i in {0, 1 .. n-1}
Github:
Coding Ninjas:
9 years ago 00:05:10 3.8K
8 years ago 00:01:07 187
10 years ago 00:08:53 28.8K
7 years ago 00:02:51 3.6K
11 years ago 00:04:24 3.1K
9 years ago 00:03:43 16.9K
10 years ago 00:09:15 489
7 years ago 00:01:16 6K
5 years ago 00:04:18 86
5 years ago 00:10:46 39
4 years ago 00:13:59 128
9 years ago 00:10:13 98.3K
2 years ago 00:05:55 25
11 years ago 01:01:45 13.4K
11 years ago 00:13:57 2.6K
10 years ago 00:04:57 400
4 years ago 00:22:07 43
![[hate5six] Jesus Piece - July 29, 2017](https://sun9-5.userapi.com/_C2jw40rE5b_XcKTD5Tz-Sppbx1Yp_1o5TGO1w/GZqeU4QNpdk.jpg)
11 years ago 01:19:31 339
9 years ago 00:09:40 132
5 years ago 01:56:33 53
10 years ago 00:13:10 11.4K
8 years ago 00:56:32 88
11 years ago 00:01:05 1.2K
11 years ago 00:25:18 52
