Leetcode 1005. Maximize Sum Of Array After K Negations

Given an integer array and k sign-flip operations, maximize the array sum by choosing which elements to negate. The core challenge is a greedy selection of the most negative values to flip first, then handling leftover flips by parity (possibly flipping the element with smallest absolute value).