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-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1229,
"likes": 1230,
"dislikes": 59,
"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}]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"41.3K\", \"totalSubmission\": \"85.7K\", \"totalAcceptedRaw\": 41320, \"totalSubmissionRaw\": 85650, \"acRate\": \"48.2%\"}",
"stats": "{\"totalAccepted\": \"41.4K\", \"totalSubmission\": \"85.8K\", \"totalAcceptedRaw\": 41387, \"totalSubmissionRaw\": 85751, \"acRate\": \"48.3%\"}",
"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?"
],