update

leetcode/originData/count-hills-and-valleys-in-an-array.json

@@ -11,8 +11,8 @@
             "translatedContent": null,
             "isPaidOnly": false,
             "difficulty": "Easy",
-            "likes": 150,
-            "dislikes": 39,
+            "likes": 190,
+            "dislikes": 44,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Find Peak Element\", \"titleSlug\": \"find-peak-element\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Monotonic Array\", \"titleSlug\": \"monotonic-array\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Minimum Subsequence in Non-Increasing Order\", \"titleSlug\": \"minimum-subsequence-in-non-increasing-order\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
             "exampleTestcases": "[2,4,1,1,6,5]\n[6,6,5,5,4,1]",
@@ -137,7 +137,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"15.5K\", \"totalSubmission\": \"27.7K\", \"totalAcceptedRaw\": 15481, \"totalSubmissionRaw\": 27660, \"acRate\": \"56.0%\"}",
+            "stats": "{\"totalAccepted\": \"17.7K\", \"totalSubmission\": \"31.4K\", \"totalAcceptedRaw\": 17702, \"totalSubmissionRaw\": 31361, \"acRate\": \"56.4%\"}",
             "hints": [
                 "For each index, could you find the closest non-equal neighbors?",
                 "Ensure that adjacent indices that are part of the same hill or valley are not double-counted."