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

6
leetcode/originData/[no content]number-of-distinct-substrings-in-a-string.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 100,
"dislikes": 25,
"likes": 103,
"dislikes": 28,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "\"aabbaba\"\n\"abcdefg\"",
@@ -52,7 +52,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"4.2K\", \"totalSubmission\": \"6.7K\", \"totalAcceptedRaw\": 4184, \"totalSubmissionRaw\": 6714, \"acRate\": \"62.3%\"}",
"stats": "{\"totalAccepted\": \"4.3K\", \"totalSubmission\": \"7K\", \"totalAcceptedRaw\": 4325, \"totalSubmissionRaw\": 6956, \"acRate\": \"62.2%\"}",
"hints": [
"Calculate the prefix hashing array for s.",
"Use the prefix hashing array to calculate the hashing value of each substring.",