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

QHEAP1

This question is designed to help you get a better understanding of basic heap operations. You will be given queries of types: " 1 v " - Add an element to the heap. " 2 v " - Delete the element from the heap. "3" - Print the minimum of all the elements in the heap. NOTE: It is guaranteed that the element to be deleted will be there in the heap. Also, at any instant, only distinct element

View Solution →

Jesse and Cookies

Jesse loves cookies. He wants the sweetness of all his cookies to be greater than value K. To do this, Jesse repeatedly mixes two cookies with the least sweetness. He creates a special combined cookie with: sweetness Least sweet cookie 2nd least sweet cookie). He repeats this procedure until all the cookies in his collection have a sweetness > = K. You are given Jesse's cookies. Print t

View Solution →

Find the Running Median

The median of a set of integers is the midpoint value of the data set for which an equal number of integers are less than and greater than the value. To find the median, you must first sort your set of integers in non-decreasing order, then: If your set contains an odd number of elements, the median is the middle element of the sorted sample. In the sorted set { 1, 2, 3 } , 2 is the median.

View Solution →

Minimum Average Waiting Time

Tieu owns a pizza restaurant and he manages it in his own way. While in a normal restaurant, a customer is served by following the first-come, first-served rule, Tieu simply minimizes the average waiting time of his customers. So he gets to decide who is served first, regardless of how sooner or later a person comes. Different kinds of pizzas take different amounts of time to cook. Also, once h

View Solution →

Merging Communities

People connect with each other in a social network. A connection between Person I and Person J is represented as . When two persons belonging to different communities connect, the net effect is the merger of both communities which I and J belongs to. At the beginning, there are N people representing N communities. Suppose person 1 and 2 connected and later 2 and 3 connected, then ,1 , 2 and 3 w

View Solution →

Components in a graph

There are 2 * N nodes in an undirected graph, and a number of edges connecting some nodes. In each edge, the first value will be between 1 and N, inclusive. The second node will be between N + 1 and , 2 * N inclusive. Given a list of edges, determine the size of the smallest and largest connected components that have or more nodes. A node can have any number of connections. The highest node valu

View Solution →