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/[no content]find-k-length-substrings-with-no-repeated-characters.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 431,
"dislikes": 10,
"likes": 437,
"dislikes": 9,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "\"havefunonleetcode\"\n5\n\"home\"\n5",
@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"29.1K\", \"totalSubmission\": \"39K\", \"totalAcceptedRaw\": 29145, \"totalSubmissionRaw\": 38997, \"acRate\": \"74.7%\"}",
"stats": "{\"totalAccepted\": \"29.6K\", \"totalSubmission\": \"39.6K\", \"totalAcceptedRaw\": 29624, \"totalSubmissionRaw\": 39609, \"acRate\": \"74.8%\"}",
"hints": [
"How to check efficiently each K-length substring?",
"First store the first leftmost K-length substring in a hashTable or array of frequencies.",