ME

You are given an integer array arr of size n. You may perform the following operation any number of times (including zero):

Choose two distinct indices i and j.
Multiply both arr[i] and arr[j] by -1 (i.e., flip their signs). Your task is to determine the maximum possible sum of the array after performing such operations. Return the maximum achievable sum.

Input:[3,[-5,-1,7]]

Output:13

solution.cpp

Loading...

Run code to see test results

00:00 / 69:42

Maximum Achievable Sum - Visa DTU

MediumMed•744 views

You are given an integer array arr of size n. You may perform the following operation any number of times (including zero):

Choose two distinct indices i and j.
Multiply both arr[i] and arr[j] by -1 (i.e., flip their signs). Your task is to determine the maximum possible sum of the array after performing such operations. Return the maximum achievable sum.