mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 07:21:40 +08:00
update
This commit is contained in:
@@ -12,7 +12,7 @@
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Easy",
|
||||
"likes": 248,
|
||||
"dislikes": 125,
|
||||
"dislikes": 127,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"4Sum\", \"titleSlug\": \"4sum\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Increasing Triplet Subsequence\", \"titleSlug\": \"increasing-triplet-subsequence\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Count Good Triplets\", \"titleSlug\": \"count-good-triplets\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
|
||||
"exampleTestcases": "[1,2,3,6]\n[3,3,6,4,5]\n[1,1,1,3,5]",
|
||||
@@ -143,7 +143,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"18.4K\", \"totalSubmission\": \"31.9K\", \"totalAcceptedRaw\": 18447, \"totalSubmissionRaw\": 31908, \"acRate\": \"57.8%\"}",
|
||||
"stats": "{\"totalAccepted\": \"18.5K\", \"totalSubmission\": \"32K\", \"totalAcceptedRaw\": 18508, \"totalSubmissionRaw\": 32003, \"acRate\": \"57.8%\"}",
|
||||
"hints": [
|
||||
"N is very small, how can we use that?",
|
||||
"Can we check every possible quadruplet?"
|
||||
|
Reference in New Issue
Block a user