Two months of python solution
\nclass Solution:\n    def largestSumAfterKNegations(self, A, K) -> int:\n\n        minvalue = min(A)\n        start = 0\n\n        while start != K:\n         
```\nclass Solution:\n    def largestSumAfterKNegations(self, A, K) -> int:\n\n        minvalue = min(A)\n        start = 0\n\n        while start != K:\n            for i in range(len(A)):\n                if A[i] == minvalue:\n                    A[i] = - A[i]\n                    break\n\n            minvalue = min(A)\n            start +=1\n\n        return sum(A)\n\n```
[]