PROBLEM OF THE DAY : 01/11/2024 | Swap and Maximize

Welcome to the daily solving of our PROBLEM OF THE DAY with Kunal Jain We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Arrays but also build up problem-solving skills.

Given an array arr[ ] of positive elements. Consider the array as a circular array, meaning the element after the last element is the first element of the array. The task is to find the maximum sum of the absolute differences between consecutive elements with shuffling of array elements allowed i.e. shuffle the array elements and make [a₁..a_n] such order that  |a₁ – a₂| + |a₂ – a₃| + …… + |a_n-1 – a_n| + |a_n – a₁| is maximized.

Examples:

Input: arr[] = [4, 2, 1, 8] Output: 18 Explanation: After Shuffling, we get [1, 8, 2, 4]. Sum of absolute difference between consecutive elements after rearrangement = |1 - 8| + |8 - 2| + |2 - 4| + |4 - 1| = 7 + 6 + 2 + 3 = 18.
 

Give the problem a try before going through the video. All the best!!!
Problem Link: https://practice.geeksforgeeks.org/problems/swap-and-maximize5859/1