update

leetcode/originData/maximize-the-confusion-of-an-exam.json

@@ -11,8 +11,8 @@
             "translatedContent": null,
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 422,
-            "dislikes": 9,
+            "likes": 469,
+            "dislikes": 10,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Longest Substring with At Most K Distinct Characters\", \"titleSlug\": \"longest-substring-with-at-most-k-distinct-characters\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Longest Repeating Character Replacement\", \"titleSlug\": \"longest-repeating-character-replacement\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Max Consecutive Ones III\", \"titleSlug\": \"max-consecutive-ones-iii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Minimum Number of Days to Make m Bouquets\", \"titleSlug\": \"minimum-number-of-days-to-make-m-bouquets\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
             "exampleTestcases": "\"TTFF\"\n2\n\"TFFT\"\n1\n\"TTFTTFTT\"\n1",
@@ -155,7 +155,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"12.6K\", \"totalSubmission\": \"22.3K\", \"totalAcceptedRaw\": 12629, \"totalSubmissionRaw\": 22312, \"acRate\": \"56.6%\"}",
+            "stats": "{\"totalAccepted\": \"13.6K\", \"totalSubmission\": \"23.8K\", \"totalAcceptedRaw\": 13617, \"totalSubmissionRaw\": 23798, \"acRate\": \"57.2%\"}",
             "hints": [
                 "Can we use the maximum length at the previous position to help us find the answer for the current position?",
                 "Can we use binary search to find the maximum consecutive same answer at every position?"