coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 15:31:43 +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/frequency-of-the-most-frequent-element.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1097,
"dislikes": 24,
"likes": 1186,
"dislikes": 26,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Find All Lonely Numbers in the Array\", \"titleSlug\": \"find-all-lonely-numbers-in-the-array\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[1,2,4]\n5\n[1,4,8,13]\n5\n[3,9,6]\n2",
@@ -167,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"19.9K\", \"totalSubmission\": \"54.5K\", \"totalAcceptedRaw\": 19875, \"totalSubmissionRaw\": 54485, \"acRate\": \"36.5%\"}",
"stats": "{\"totalAccepted\": \"21.2K\", \"totalSubmission\": \"57.5K\", \"totalAcceptedRaw\": 21161, \"totalSubmissionRaw\": 57522, \"acRate\": \"36.8%\"}",
"hints": [
"Note that you can try all values in a brute force manner and find the maximum frequency of that value.",
"To find the maximum frequency of a value consider the biggest elements smaller than or equal to this value"