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.