coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 23:11:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/minimum-difference-in-sums-after-removal-of-elements.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 313,
"likes": 328,
"dislikes": 5,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Product of Array Except Self\", \"titleSlug\": \"product-of-array-except-self\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Find Subsequence of Length K With the Largest Sum\", \"titleSlug\": \"find-subsequence-of-length-k-with-the-largest-sum\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"4.5K\", \"totalSubmission\": \"9.8K\", \"totalAcceptedRaw\": 4451, \"totalSubmissionRaw\": 9756, \"acRate\": \"45.6%\"}",
"stats": "{\"totalAccepted\": \"4.6K\", \"totalSubmission\": \"10.2K\", \"totalAcceptedRaw\": 4633, \"totalSubmissionRaw\": 10177, \"acRate\": \"45.5%\"}",
"hints": [
"The lowest possible difference can be obtained when the sum of the first n elements in the resultant array is minimum, and the sum of the next n elements is maximum.",
"For every index i, think about how you can find the minimum possible sum of n elements with indices lesser or equal to i, if possible.",