coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01: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/maximum-repeating-substring.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 365,
"dislikes": 121,
"likes": 371,
"dislikes": 126,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Detect Pattern of Length M Repeated K or More Times\", \"titleSlug\": \"detect-pattern-of-length-m-repeated-k-or-more-times\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
"exampleTestcases": "\"ababc\"\n\"ab\"\n\"ababc\"\n\"ba\"\n\"ababc\"\n\"ac\"",
@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"23.1K\", \"totalSubmission\": \"58.5K\", \"totalAcceptedRaw\": 23148, \"totalSubmissionRaw\": 58507, \"acRate\": \"39.6%\"}",
"stats": "{\"totalAccepted\": \"23.9K\", \"totalSubmission\": \"60.3K\", \"totalAcceptedRaw\": 23884, \"totalSubmissionRaw\": 60303, \"acRate\": \"39.6%\"}",
"hints": [
"The constraints are low enough for a brute force approach.",
"Try every k value from 0 upwards until word is no longer k-repeating."