Maximize subsequence sum after putting plus minus sign alternatively on elements
Given an array arr[] of size N. The task is to find the maximum score that can be achieved by alternative minus - plus of elements of any subsequence in the array. Example: Input: arr[] = {2, 3, 6, 5, 4, 7, 8}, N = 7Output: 10Explanation: Pick the sequence as {2, 3, 6, 5, 4, 7, 8} = {6, 4, 8}. So, a