LeetCode 1589: Maximum Sum Obtained of Any Permutation Solution

Master LeetCode problem 1589 (Maximum Sum Obtained of Any Permutation), a medium challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

1589. Maximum Sum Obtained of Any Permutation

Medium

Array Greedy Sorting Prefix Sum

Problem Explanation

Explanation

To solve this problem, we need to find the maximum sum obtained by any permutation of the given nums array based on the given requests. We can achieve this by considering the frequency of each index in the requests and then sorting both the nums array and the request indices. By iteratively distributing the values from the largest to smallest elements in the nums array to the requested indices, we can find the maximum total sum.

Calculate the frequency of each index in the requests.
Sort both the nums array and the requests based on the values.
Iterate through the sorted nums array and update the requested indices with the maximum values.
Calculate the total sum based on the updated requests.

Time complexity: O(n log n) where n is the number of elements in the nums array. Space complexity: O(n) for storing the frequency of indices.

Solution Code

class Solution {
    public int maxSumRangeQuery(int[] nums, int[][] requests) {
        int n = nums.length;
        int[] freq = new int[n];
        for (int[] request : requests) {
            freq[request[0]]++;
            if (request[1] + 1 < n) {
                freq[request[1] + 1]--;
            }
        }
        for (int i = 1; i < n; i++) {
            freq[i] += freq[i - 1];
        }

        Arrays.sort(nums);
        Arrays.sort(freq);

        long result = 0;
        int mod = 1000000007;
        for (int i = 0; i < n; i++) {
            result = (result + (long) nums[i] * freq[i]) % mod;
        }

        return (int) result;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 1589 (Maximum Sum Obtained of Any Permutation)?

This page provides optimized solutions for LeetCode problem 1589 (Maximum Sum Obtained of Any Permutation) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 1589 (Maximum Sum Obtained of Any Permutation)?

The time complexity for LeetCode 1589 (Maximum Sum Obtained of Any Permutation) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 1589 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 1589 in Java, C++, or Python.

Back to LeetCode Solutions