update

leetcode/originData/minimum-number-of-operations-to-make-array-continuous.json

@@ -11,7 +11,7 @@
             "translatedContent": null,
             "isPaidOnly": false,
             "difficulty": "Hard",
-            "likes": 386,
+            "likes": 410,
             "dislikes": 4,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Longest Repeating Character Replacement\", \"titleSlug\": \"longest-repeating-character-replacement\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Continuous Subarray Sum\", \"titleSlug\": \"continuous-subarray-sum\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Moving Stones Until Consecutive II\", \"titleSlug\": \"moving-stones-until-consecutive-ii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Minimum One Bit Operations to Make Integers Zero\", \"titleSlug\": \"minimum-one-bit-operations-to-make-integers-zero\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Minimum Adjacent Swaps for K Consecutive Ones\", \"titleSlug\": \"minimum-adjacent-swaps-for-k-consecutive-ones\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
@@ -143,7 +143,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"6K\", \"totalSubmission\": \"13.2K\", \"totalAcceptedRaw\": 6045, \"totalSubmissionRaw\": 13183, \"acRate\": \"45.9%\"}",
+            "stats": "{\"totalAccepted\": \"6.5K\", \"totalSubmission\": \"14.1K\", \"totalAcceptedRaw\": 6465, \"totalSubmissionRaw\": 14095, \"acRate\": \"45.9%\"}",
             "hints": [
                 "Sort the array.",
                 "For every index do a binary search to get the possible right end of the window and calculate the possible answer."