Fastest 3 liner solution with inbuilt functions
\nvar largestSumAfterKNegations = function(nums, k) {\n    while(k>0){\n        let i = nums.indexOf(Math.min(...nums)); //find the index of minimum item in arr
```\nvar largestSumAfterKNegations = function(nums, k) {\n    while(k>0){\n        let i = nums.indexOf(Math.min(...nums)); //find the index of minimum item in array using inbuilt function\n        nums[i]*=-1; //Toggle the minimum value to get the maximum sum\n        k--;\n    }\n    return nums.reduce((acc, curr)=>acc+curr); //return the sum using reduce function\n};\n```\n\n**Please upvote if I could help**\nOpen to Suggestions :)
['JavaScript']