# Maximize Sum Of An Array After K Negations (LeetCode 1005) ## Goal After k sign flips, maximize array sum. ## Approach Min-heap / sort; flip smallest (most negative) first; if k left odd, flip the smallest abs. ## Tip Greedy on the current minimum beats DP here. Practice greedy flips with [interview copilot app](https://www.linkjob.ai/interview-copilot/).