Easy-to-Understand Javascript Solution
\n var largestSumAfterKNegations = function(nums, k) {\n    const sortedNums = nums.sort((a,b) => a-b);\n    let lowestPos = 0;\n    for (let i = 0; i < k; i++)
```\n var largestSumAfterKNegations = function(nums, k) {\n    const sortedNums = nums.sort((a,b) => a-b);\n    let lowestPos = 0;\n    for (let i = 0; i < k; i++) {\n        // keep track of the lowest positive number\n        if (sortedNums[i] < sortedNums[lowestPos]) lowestPos = i;\n        // if the number is negative, flip it, otherwise continue to flip the lowest positive number\n        sortedNums[i] < 0 ? sortedNums[i] = -sortedNums[i] : sortedNums[lowestPos] = -sortedNums[lowestPos];\n    }\n    return sortedNums.reduce((a,b) => a + b);\n};\n```
['JavaScript']