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-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

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