coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51:41 +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/smallest-subsequence-of-distinct-characters.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1595,
"likes": 1602,
"dislikes": 141,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Find the Most Competitive Subsequence\", \"titleSlug\": \"find-the-most-competitive-subsequence\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"37.4K\", \"totalSubmission\": \"65.9K\", \"totalAcceptedRaw\": 37366, \"totalSubmissionRaw\": 65871, \"acRate\": \"56.7%\"}",
"stats": "{\"totalAccepted\": \"37.4K\", \"totalSubmission\": \"66K\", \"totalAcceptedRaw\": 37433, \"totalSubmissionRaw\": 65990, \"acRate\": \"56.7%\"}",
"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."
],