Leetcode 1891. Cutting Ribbons
Given an array of ribbon lengths and a target k, determine the maximum integer piece length you can cut the ribbons into so that you obtain at least k pieces (return 0 if impossible). This is solved by searching the largest feasible length and testing feasibility by counting how many pieces each ribbon yields.
Asked at:
Meta
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Late September, 2024
Meta
Mid-level
Cut Wood - Given an array of wood lengths and a target length, determine the maximum height at which to cut all pieces so that the sum of the remaining lengths is greater than or equal to the target
Your account is free and you can post anonymously if you choose.