update

leetcode/originData/most-frequent-number-following-key-in-an-array.json

@@ -11,8 +11,8 @@
             "translatedContent": null,
             "isPaidOnly": false,
             "difficulty": "Easy",
-            "likes": 116,
-            "dislikes": 57,
+            "likes": 136,
+            "dislikes": 68,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Sort Array by Increasing Frequency\", \"titleSlug\": \"sort-array-by-increasing-frequency\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
             "exampleTestcases": "[1,100,200,1,100]\n1\n[2,2,2,2,3]\n2",
@@ -149,7 +149,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"15.4K\", \"totalSubmission\": \"25.5K\", \"totalAcceptedRaw\": 15407, \"totalSubmissionRaw\": 25522, \"acRate\": \"60.4%\"}",
+            "stats": "{\"totalAccepted\": \"16.8K\", \"totalSubmission\": \"27.7K\", \"totalAcceptedRaw\": 16794, \"totalSubmissionRaw\": 27670, \"acRate\": \"60.7%\"}",
             "hints": [
                 "Count the number of times each target value follows the key in the array.",
                 "Choose the target with the maximum count and return it."