coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-07 00:11:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode-cn/originData/[no content]find-k-length-substrings-with-no-repeated-characters.json
View File

@@ -12,7 +12,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 36,
"likes": 37,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"6.5K\", \"totalSubmission\": \"9.2K\", \"totalAcceptedRaw\": 6480, \"totalSubmissionRaw\": 9191, \"acRate\": \"70.5%\"}",
"stats": "{\"totalAccepted\": \"6.5K\", \"totalSubmission\": \"9.2K\", \"totalAcceptedRaw\": 6498, \"totalSubmissionRaw\": 9218, \"acRate\": \"70.5%\"}",
"hints": [
"How to check efficiently each K-length substring?",
"First store the first leftmost K-length substring in a hashTable or array of frequencies.",