1
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
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

View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 803,
"likes": 828,
"dislikes": 14,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Longest Substring Without Repeating Characters\", \"titleSlug\": \"longest-substring-without-repeating-characters\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"40.5K\", \"totalSubmission\": \"77.3K\", \"totalAcceptedRaw\": 40491, \"totalSubmissionRaw\": 77341, \"acRate\": \"52.4%\"}",
"stats": "{\"totalAccepted\": \"41.3K\", \"totalSubmission\": \"78.8K\", \"totalAcceptedRaw\": 41311, \"totalSubmissionRaw\": 78812, \"acRate\": \"52.4%\"}",
"hints": [
"The main point here is for the subarray to contain unique elements for each index. Only the first subarrays starting from that index have unique elements.",
"This can be solved using the two pointers technique"