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-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/check-if-array-pairs-are-divisible-by-k.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 904,
"likes": 906,
"dislikes": 54,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Count Array Pairs Divisible by K\", \"titleSlug\": \"count-array-pairs-divisible-by-k\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"29.8K\", \"totalSubmission\": \"73.5K\", \"totalAcceptedRaw\": 29750, \"totalSubmissionRaw\": 73539, \"acRate\": \"40.5%\"}",
"stats": "{\"totalAccepted\": \"29.8K\", \"totalSubmission\": \"73.7K\", \"totalAcceptedRaw\": 29787, \"totalSubmissionRaw\": 73650, \"acRate\": \"40.4%\"}",
"hints": [
"Keep an array of the frequencies of ((x % k) + k) % k for each x in arr.",
"for each i in [0, k - 1] we need to check if freq[k] == freq[k - i]",