1589

Author: lzl124631x

README.md

@@ -658,6 +658,7 @@ Now I'm using a Chrome Extension I developed -- [LeetCoder](https://chrome.googl
 861 | Score After Flipping Matrix | Medium | [Solution](leetcode/861.%20Score%20After%20Flipping%20Matrix)
 862 | Shortest Subarray with Sum at Least K | Hard | [Solution](leetcode/862.%20Shortest%20Subarray%20with%20Sum%20at%20Least%20K)
 863 | All Nodes Distance K in Binary Tree | Medium | [Solution](leetcode/863.%20All%20Nodes%20Distance%20K%20in%20Binary%20Tree)
+866 | Prime Palindrome | Medium | [Solution](leetcode/866.%20Prime%20Palindrome)
 867 | Transpose Matrix | Easy | [Solution](leetcode/867.%20Transpose%20Matrix)
 868 | Binary Gap | Easy | [Solution](leetcode/868.%20Binary%20Gap)
 869 | Reordered Power of 2 | Medium | [Solution](leetcode/869.%20Reordered%20Power%20of%202)
@@ -1060,7 +1061,9 @@ Now I'm using a Chrome Extension I developed -- [LeetCoder](https://chrome.googl
 1583 | Count Unhappy Friends | Medium | [Solution](leetcode/1583.%20Count%20Unhappy%20Friends)
 1584 | Min Cost to Connect All Points | Medium | [Solution](leetcode/1584.%20Min%20Cost%20to%20Connect%20All%20Points)
 1585 | Check If String Is Transformable With Substring Sort Operations | Hard | [Solution](leetcode/1585.%20Check%20If%20String%20Is%20Transformable%20With%20Substring%20Sort%20Operations)
+1589 | Maximum Sum Obtained of Any Permutation | Medium | [Solution](leetcode/1589.%20Maximum%20Sum%20Obtained%20of%20Any%20Permutation)
 1591 | Strange Printer II | Hard | [Solution](leetcode/1591.%20Strange%20Printer%20II)
+1595 | Minimum Cost to Connect Two Groups of Points | Hard | [Solution](leetcode/1595.%20Minimum%20Cost%20to%20Connect%20Two%20Groups%20of%20Points)
 
 # License
 

leetcode/1589. Maximum Sum Obtained of Any Permutation/README.md

@@ -0,0 +1,79 @@
+# [1589. Maximum Sum Obtained of Any Permutation (Medium)](https://leetcode.com/problems/maximum-sum-obtained-of-any-permutation/)
+
+<p>We have an array of integers, <code>nums</code>, and an array of <code>requests</code> where <code>requests[i] = [start<sub>i</sub>, end<sub>i</sub>]</code>. The <code>i<sup>th</sup></code> request asks for the sum of <code>nums[start<sub>i</sub>] + nums[start<sub>i</sub> + 1] + ... + nums[end<sub>i</sub> - 1] + nums[end<sub>i</sub>]</code>. Both <code>start<sub>i</sub></code> and <code>end<sub>i</sub></code> are <em>0-indexed</em>.</p>
+
+<p>Return <em>the maximum total sum of all requests <strong>among all permutations</strong> of</em> <code>nums</code>.</p>
+
+<p>Since the answer may be too large, return it <strong>modulo</strong> <code>10<sup>9</sup> + 7</code>.</p>
+
+<p>&nbsp;</p>
+<p><strong>Example 1:</strong></p>
+
+<pre><strong>Input:</strong> nums = [1,2,3,4,5], requests = [[1,3],[0,1]]
+<strong>Output:</strong> 19
+<strong>Explanation:</strong> One permutation of nums is [2,1,3,4,5] with the following result: 
+requests[0] -&gt; nums[1] + nums[2] + nums[3] = 1 + 3 + 4 = 8
+requests[1] -&gt; nums[0] + nums[1] = 2 + 1 = 3
+Total sum: 8 + 3 = 11.
+A permutation with a higher total sum is [3,5,4,2,1] with the following result:
+requests[0] -&gt; nums[1] + nums[2] + nums[3] = 5 + 4 + 2 = 11
+requests[1] -&gt; nums[0] + nums[1] = 3 + 5  = 8
+Total sum: 11 + 8 = 19, which is the best that you can do.
+</pre>
+
+<p><strong>Example 2:</strong></p>
+
+<pre><strong>Input:</strong> nums = [1,2,3,4,5,6], requests = [[0,1]]
+<strong>Output:</strong> 11
+<strong>Explanation:</strong> A permutation with the max total sum is [6,5,4,3,2,1] with request sums [11].</pre>
+
+<p><strong>Example 3:</strong></p>
+
+<pre><strong>Input:</strong> nums = [1,2,3,4,5,10], requests = [[0,2],[1,3],[1,1]]
+<strong>Output:</strong> 47
+<strong>Explanation:</strong> A permutation with the max total sum is [4,10,5,3,2,1] with request sums [19,18,10].</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>n == nums.length</code></li>
+	<li><code>1 &lt;= n &lt;= 10<sup>5</sup></code></li>
+	<li><code>0 &lt;= nums[i]&nbsp;&lt;= 10<sup>5</sup></code></li>
+	<li><code>1 &lt;= requests.length &lt;=&nbsp;10<sup>5</sup></code></li>
+	<li><code>requests[i].length == 2</code></li>
+	<li><code>0 &lt;= start<sub>i</sub>&nbsp;&lt;= end<sub>i</sub>&nbsp;&lt;&nbsp;n</code></li>
+</ul>
+
+
+**Related Topics**:  
+[Greedy](https://leetcode.com/tag/greedy/)
+
+## Solution 1.
+
+For each `requests[i]`, add `1` at `cnt[requests[i][0]]` and subtract `1` at `cnt[requests[i][1] + 1]`. Then compute prefix sum in-place on `cnt`, `cnt[i]` becomes the corresponding count of `nums[i]`.
+
+Sort `cnt` and `nums`, and the sum of `nums[i] * cnt[i]` is the answer.
+
+```cpp
+// OJ: https://leetcode.com/problems/maximum-sum-obtained-of-any-permutation/
+// Author: github.com/lzl124631x
+// Time: O(NlogN)
+// Space: O(N)
+class Solution {
+public:
+    int maxSumRangeQuery(vector<int>& A, vector<vector<int>>& R) {
+        long mod = 1e9+7, N = A.size(), ans = 0;
+        vector<int> cnt(N);
+        for (int i = 0; i < R.size(); ++i) {
+            if (R[i][1] < N - 1) cnt[R[i][1] + 1]--;
+            cnt[R[i][0]]++;
+        }
+        for (int i = 1; i < N; ++i) cnt[i] += cnt[i - 1];
+        sort(begin(cnt), end(cnt));
+        sort(begin(A), end(A));
+        for (int i = 0; i < N; ++i) ans = (ans + (A[i] * cnt[i]) % mod) % mod;
+        return ans;
+    }
+};
+```

readme.sh

@@ -28,6 +28,11 @@ Please give this repo a :star: if it inspires you. Thanks. :blush:
 😩 Hate manually copy & pasting the example testcases when solving LeetCode problems?  
 👉 Try my [LeetCode Testcase Extractor](https://liuzhenglai.com/post/5e6f2551e9a0d01760b274d8)
 
+Now I'm using a Chrome Extension I developed -- [LeetCoder](https://chrome.google.com/webstore/detail/gkmoalkjclphfhgnhdlilebaolpdkgpf) -- to facilitate my having fun on LeetCode. Features including but not limited to:
+* showing stats
+* copying problem, answer and **testcases**
+* randomly picking a problem.
+
 \# | Title | Difficulty | Solution
 ---|---|---|---" >> $file