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/get-equal-substrings-within-budget.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 619,
"dislikes": 42,
"likes": 636,
"dislikes": 43,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "\"abcd\"\n\"bcdf\"\n3\n\"abcd\"\n\"cdef\"\n3\n\"abcd\"\n\"acde\"\n0",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"28.2K\", \"totalSubmission\": \"60.6K\", \"totalAcceptedRaw\": 28177, \"totalSubmissionRaw\": 60626, \"acRate\": \"46.5%\"}",
"stats": "{\"totalAccepted\": \"28.6K\", \"totalSubmission\": \"61.6K\", \"totalAcceptedRaw\": 28636, \"totalSubmissionRaw\": 61573, \"acRate\": \"46.5%\"}",
"hints": [
"Calculate the differences between a[i] and b[i].",
"Use a sliding window to track the longest valid substring."