Largest Sum After K Negations - Amazon Top Interview Questions


Problem Statement :


You are given a list of integers nums and an integer k. Consider an operation where you pick an element in nums and negate it. Given that you must make exactly k operations, return the maximum resulting sum that can be obtained.

Constraints

n ≤ 100,000 where n is the length of nums
k < 2 ** 31

Example 1

Input

nums = [1, 0, -5, -3]
k = 4


Output
9

Explanation

We can negate -5 and -3 once each and 0 twice to get [1, 0, 5, 3] and its sum is 9.


Solution :



title-img 




                        Solution in C++ :

int solve(vector<int>& nums, int k) {
    int l = nums.size();
    if (l < 1) return 0;
    sort(nums.begin(), nums.end());
    int i, sum = 0;
    for (i = 0; i < l; i++) {
        if (nums[i] >= 0 || k <= 0) break;
        nums[i] *= -1;
        k--;
        sum += nums[i];
    }
    if (k % 2) {
        if (i == l)
            sum -= 2 * nums[i - 1];
        else if (i == 0)
            sum -= 2 * nums[i];
        else
            sum -= 2 * min(nums[i - 1], nums[i]);
    }
    for (; i < l; i++) sum += nums[i];
    return sum;
}
                    


                        Solution in Java :

import java.util.*;

class Solution {
    public int solve(int[] nums, int k) {
        Arrays.sort(nums);
        int min = Integer.MAX_VALUE;
        int sum = 0;
        for (int i = 0; i < nums.length; i++) {
            if (nums[i] < 0 && k > 0) {
                nums[i] = Math.abs(nums[i]);
                k--;
            } else if (nums[i] == 0)
                k = 0;
            sum += nums[i];
            min = Math.min(nums[i], min);
        }
        if (k != 0) {
            if (k % 2 != 0) {
                sum -= min * 2;
            }
        }
        return sum;
    }
}
                    


                        Solution in Python : 
                            
class Solution:
    def solve(self, nums, k):
        if not nums:
            return 0
        heap = []
        for n in nums:
            heapq.heappush(heap, n)
        while k > 0:
            minElement = heapq.heappop(heap)
            if minElement == 0:
                break
            minElement = minElement * (-1)
            heapq.heappush(heap, minElement)
            k -= 1
        return sum(heap)


View More Similar Problems

Jim and the Skyscrapers

Jim has invented a new flying object called HZ42. HZ42 is like a broom and can only fly horizontally, independent of the environment. One day, Jim started his flight from Dubai's highest skyscraper, traveled some distance and landed on another skyscraper of same height! So much fun! But unfortunately, new skyscrapers have been built recently. Let us describe the problem in one dimensional space

View Solution →

Palindromic Subsets

Consider a lowercase English alphabetic letter character denoted by c. A shift operation on some c turns it into the next letter in the alphabet. For example, and ,shift(a) = b , shift(e) = f, shift(z) = a . Given a zero-indexed string, s, of n lowercase letters, perform q queries on s where each query takes one of the following two forms: 1 i j t: All letters in the inclusive range from i t

View Solution →

Counting On a Tree

Taylor loves trees, and this new challenge has him stumped! Consider a tree, t, consisting of n nodes. Each node is numbered from 1 to n, and each node i has an integer, ci, attached to it. A query on tree t takes the form w x y z. To process a query, you must print the count of ordered pairs of integers ( i , j ) such that the following four conditions are all satisfied: the path from n

View Solution →

Polynomial Division

Consider a sequence, c0, c1, . . . , cn-1 , and a polynomial of degree 1 defined as Q(x ) = a * x + b. You must perform q queries on the sequence, where each query is one of the following two types: 1 i x: Replace ci with x. 2 l r: Consider the polynomial and determine whether is divisible by over the field , where . In other words, check if there exists a polynomial with integer coefficie

View Solution →

Costly Intervals

Given an array, your goal is to find, for each element, the largest subarray containing it whose cost is at least k. Specifically, let A = [A1, A2, . . . , An ] be an array of length n, and let be the subarray from index l to index r. Also, Let MAX( l, r ) be the largest number in Al. . . r. Let MIN( l, r ) be the smallest number in Al . . .r . Let OR( l , r ) be the bitwise OR of the

View Solution →

The Strange Function

One of the most important skills a programmer needs to learn early on is the ability to pose a problem in an abstract way. This skill is important not just for researchers but also in applied fields like software engineering and web development. You are able to solve most of a problem, except for one last subproblem, which you have posed in an abstract way as follows: Given an array consisting

View Solution →