coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 23:11:41 +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/maximum-number-of-occurrences-of-a-substring.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 582,
"dislikes": 290,
"likes": 601,
"dislikes": 292,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "\"aababcaab\"\n2\n3\n4\n\"aaaa\"\n1\n3\n3",
@@ -131,7 +131,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"31.8K\", \"totalSubmission\": \"60.8K\", \"totalAcceptedRaw\": 31806, \"totalSubmissionRaw\": 60758, \"acRate\": \"52.3%\"}",
"stats": "{\"totalAccepted\": \"32.5K\", \"totalSubmission\": \"62.1K\", \"totalAcceptedRaw\": 32513, \"totalSubmissionRaw\": 62064, \"acRate\": \"52.4%\"}",
"hints": [
"Check out the constraints, (maxSize <=26).",
"This means you can explore all substrings in O(n * 26).",