update

leetcode/originData/array-partition-i.json

@@ -11,8 +11,8 @@
             "translatedContent": null,
             "isPaidOnly": false,
             "difficulty": "Easy",
-            "likes": 755,
-            "dislikes": 128,
+            "likes": 786,
+            "dislikes": 132,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Minimum Difference Between Highest and Lowest of K Scores\", \"titleSlug\": \"minimum-difference-between-highest-and-lowest-of-k-scores\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Minimum Cost of Buying Candies With Discount\", \"titleSlug\": \"minimum-cost-of-buying-candies-with-discount\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"All Divisions With the Highest Score of a Binary Array\", \"titleSlug\": \"all-divisions-with-the-highest-score-of-a-binary-array\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
             "exampleTestcases": "[1,4,3,2]\n[6,2,6,5,1,2]",
@@ -155,7 +155,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"319.7K\", \"totalSubmission\": \"423.6K\", \"totalAcceptedRaw\": 319662, \"totalSubmissionRaw\": 423577, \"acRate\": \"75.5%\"}",
+            "stats": "{\"totalAccepted\": \"323.9K\", \"totalSubmission\": \"428.5K\", \"totalAcceptedRaw\": 323944, \"totalSubmissionRaw\": 428498, \"acRate\": \"75.6%\"}",
             "hints": [
                 "Obviously, brute force won't help here. Think of something else, take some example like 1,2,3,4.",
                 "How will you make pairs to get the result? There must be some pattern.",