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/largest-substring-between-two-equal-characters.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 373,
"dislikes": 23,
"likes": 379,
"dislikes": 24,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "\"aa\"\n\"abca\"\n\"cbzxy\"",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"30.9K\", \"totalSubmission\": \"52.2K\", \"totalAcceptedRaw\": 30878, \"totalSubmissionRaw\": 52163, \"acRate\": \"59.2%\"}",
"stats": "{\"totalAccepted\": \"31.7K\", \"totalSubmission\": \"53.5K\", \"totalAcceptedRaw\": 31709, \"totalSubmissionRaw\": 53495, \"acRate\": \"59.3%\"}",
"hints": [
"Try saving the first and last position of each character",
"Try finding every pair of indexes with equal characters"