update

leetcode/originData/minimum-deletions-to-make-array-beautiful.json

@@ -11,8 +11,8 @@
             "translatedContent": null,
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 87,
-            "dislikes": 51,
+            "likes": 186,
+            "dislikes": 61,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Minimum Deletions to Make Character Frequencies Unique\", \"titleSlug\": \"minimum-deletions-to-make-character-frequencies-unique\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Minimum Operations to Make the Array Alternating\", \"titleSlug\": \"minimum-operations-to-make-the-array-alternating\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
             "exampleTestcases": "[1,1,2,3,5]\n[1,1,2,2,3,3]",
@@ -143,7 +143,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"8.8K\", \"totalSubmission\": \"22.9K\", \"totalAcceptedRaw\": 8844, \"totalSubmissionRaw\": 22915, \"acRate\": \"38.6%\"}",
+            "stats": "{\"totalAccepted\": \"12.6K\", \"totalSubmission\": \"30K\", \"totalAcceptedRaw\": 12642, \"totalSubmissionRaw\": 30001, \"acRate\": \"42.1%\"}",
             "hints": [
                 "Delete as many adjacent equal elements as necessary.",
                 "If the length of nums is odd after the entire process, delete the last element."