Rope Cutting Product | Dynamic Programming | C++ Solution
Rope Cutting Product, is a Dynamic Programming related problem and in this post we will see how we can solve this challenge in C++
given rope with length 'n'.Find how many cuts should be made so that the product of the cuts is maximum.Atleast one cut has to be made and min length is 2
Please check the main.cpp snippet for the solution.
This solution originally posted at: Github by @susantabiswas