coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +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

6
leetcode/originData/find-the-most-competitive-subsequence.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1230,
"dislikes": 59,
"likes": 1265,
"dislikes": 60,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Remove K Digits\", \"titleSlug\": \"remove-k-digits\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Smallest Subsequence of Distinct Characters\", \"titleSlug\": \"smallest-subsequence-of-distinct-characters\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[3,5,2,6]\n2\n[2,4,3,3,5,4,9,6]\n4",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"41.4K\", \"totalSubmission\": \"85.8K\", \"totalAcceptedRaw\": 41387, \"totalSubmissionRaw\": 85751, \"acRate\": \"48.3%\"}",
"stats": "{\"totalAccepted\": \"42K\", \"totalSubmission\": \"86.8K\", \"totalAcceptedRaw\": 42021, \"totalSubmissionRaw\": 86837, \"acRate\": \"48.4%\"}",
"hints": [
"In lexicographical order, the elements to the left have higher priority than those that come after. Can you think of a strategy that incrementally builds the answer from left to right?"
],