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/find-missing-observations.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 206,
"likes": 211,
"dislikes": 9,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Number of Dice Rolls With Target Sum\", \"titleSlug\": \"number-of-dice-rolls-with-target-sum\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Dice Roll Simulation\", \"titleSlug\": \"dice-roll-simulation\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"12.6K\", \"totalSubmission\": \"30.2K\", \"totalAcceptedRaw\": 12588, \"totalSubmissionRaw\": 30156, \"acRate\": \"41.7%\"}",
"stats": "{\"totalAccepted\": \"13K\", \"totalSubmission\": \"31K\", \"totalAcceptedRaw\": 13042, \"totalSubmissionRaw\": 30993, \"acRate\": \"42.1%\"}",
"hints": [
"What should the sum of the n rolls be?",
"Could you generate an array of size n such that each element is between 1 and 6?"