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: