Status: IN
`max_sum` computes the answer in O(1) time with no loops or data structures, reducing the greedy pick strategy to `min(k, numOnes) - max(0, k - numOnes - numZeros)`.
Source: entries/2026/06/06/k-items-with-the-maximum-sum-solution.md
JSON