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/smallest-subsequence-of-distinct-characters.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1602,
"dislikes": 141,
"likes": 1625,
"dislikes": 143,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Find the Most Competitive Subsequence\", \"titleSlug\": \"find-the-most-competitive-subsequence\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "\"bcabc\"\n\"cbacdcbc\"",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"37.4K\", \"totalSubmission\": \"66K\", \"totalAcceptedRaw\": 37433, \"totalSubmissionRaw\": 65990, \"acRate\": \"56.7%\"}",
"stats": "{\"totalAccepted\": \"38.3K\", \"totalSubmission\": \"67.3K\", \"totalAcceptedRaw\": 38268, \"totalSubmissionRaw\": 67334, \"acRate\": \"56.8%\"}",
"hints": [
"Greedily try to add one missing character. How to check if adding some character will not cause problems ? Use bit-masks to check whether you will be able to complete the sub-sequence if you add the character at some index i."
],