Swap and Maximize | GeeksForGeeks | Problem of the Day

[@mathematics3398]

Table of Contents
0:00 Problem Statement
0:58 Solution
5:10 Pseudo Code
6:25 Code - Python
6:57 Code - C++

[@mathematics3398]

class Solution {
public:
long long maxSum(vector& arr) {
sort(arr.begin(), arr.end());
long long ans = 0;
int n = arr.size();
for (int i = 0; i < n/2; i++) {
ans += 2*arr[n - 1 - i];
ans -= 2*arr[i];
}
return ans;
}
};

[@mathematics3398]

class Solution:
def maxSum(self,arr):
ans = 0
n = len(arr)
arr.sort()
for i in range(n//2):
ans += 2*arr[n-1-i]
ans -= 2*arr[i]
return ans