algorithms.tutorialhorizon.com
Dynamic Programming - Maximum Product Cutting Problem. | Algorithms
Given a rope of length n meters, write an algorithm to cut the rope in such a way that product of different lengths of rope is maximum. At least one cut has to be made.