Leetcode Problem 1589. Maximum Sum Obtained of Any Permutation

1589. Maximum Sum Obtained of Any Permutation

Leetcode Solutions

Initialize a frequency array freq with a length of n + 1, where n is the length of nums.\n2. For each request [start, end] in requests, increment freq[start] and decrement freq[end + 1].\n3. Iterate through freq and update each freq[i] with the cumulative sum up to that index to get the frequency of requests for each index.\n4. Sort nums and freq in descending order.\n5. Initialize sum to 0.\n6. Iterate through nums and freq, multiplying each element in nums by the corresponding frequency and adding it to sum.\n7. Take sum modulo 10^9 + 7 to get the final result.\n8. Return sum.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen