# Maximize the Equal Wood Segment Length ## Problem You have several pieces of wood with positive integer lengths. A piece may be cut into shorter segments, but material from different pieces cannot be joined. Leftover material may be discarded. Return the largest positive integer length `L` for which the wood can produce at least `k` segments of length `L`. Return `0` if even length `1` cannot produce `k` segments. ### Function Contract Implement `maxSegmentLength(woods, k)`. - Input: a list of positive integer wood lengths and a positive integer `k`. - Output: the maximum feasible integer segment length, or `0` when none is feasible. ### Examples ```text Input: woods = [9, 7, 5], k = 5 Output: 3 Explanation: lengths 9, 7, and 5 produce 3, 2, and 1 segments of length 3. ``` ```text Input: woods = [2, 3], k = 6 Output: 0 ``` ### Clarifications - Cutting has no loss beyond the discarded remainder. - The answer cannot exceed the longest original piece because segments cannot be assembled from multiple pieces. - The segment count for a candidate length may be larger than `k`; only feasibility matters. ```hint Test a proposed length For a fixed positive length, count how many whole segments each piece contributes and decide whether the total reaches `k`. ``` ```hint Look for monotonicity If one candidate length is feasible, determine what that implies about every smaller positive candidate. ```