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

4
leetcode/originData/smallest-k-length-subsequence-with-occurrences-of-a-letter.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 239,
"likes": 251,
"dislikes": 6,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Remove Duplicate Letters\", \"titleSlug\": \"remove-duplicate-letters\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"4.1K\", \"totalSubmission\": \"10.8K\", \"totalAcceptedRaw\": 4147, \"totalSubmissionRaw\": 10774, \"acRate\": \"38.5%\"}",
"stats": "{\"totalAccepted\": \"4.4K\", \"totalSubmission\": \"11.4K\", \"totalAcceptedRaw\": 4420, \"totalSubmissionRaw\": 11405, \"acRate\": \"38.8%\"}",
"hints": [
"Use stack. For every character to be appended, decide how many character(s) from the stack needs to get popped based on the stack length and the count of the required character.",
"Pop the extra characters out from the stack and return the characters in the stack (reversed)."