Loading Company...
This is a verified interview question from Visa. Candidates reporting seeing this problem in recent Online Assessments (OAs) and onsite rounds. Mastering "Maximum Achievable Sum - Visa DTU" covers key patterns like Arrays.
"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."
Join thousands of developers practicing for Visa.