update

leetcode/originData/longest-substring-of-one-repeating-character.json

@@ -11,8 +11,8 @@
             "translatedContent": null,
             "isPaidOnly": false,
             "difficulty": "Hard",
-            "likes": 67,
-            "dislikes": 57,
+            "likes": 102,
+            "dislikes": 67,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Merge Intervals\", \"titleSlug\": \"merge-intervals\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Longest Repeating Character Replacement\", \"titleSlug\": \"longest-repeating-character-replacement\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Consecutive Characters\", \"titleSlug\": \"consecutive-characters\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Create Sorted Array through Instructions\", \"titleSlug\": \"create-sorted-array-through-instructions\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
             "exampleTestcases": "\"babacc\"\n\"bcb\"\n[1,3,3]\n\"abyzz\"\n\"aa\"\n[2,1]",
@@ -155,7 +155,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"1.6K\", \"totalSubmission\": \"5.8K\", \"totalAcceptedRaw\": 1587, \"totalSubmissionRaw\": 5806, \"acRate\": \"27.3%\"}",
+            "stats": "{\"totalAccepted\": \"1.9K\", \"totalSubmission\": \"6.8K\", \"totalAcceptedRaw\": 1943, \"totalSubmissionRaw\": 6815, \"acRate\": \"28.5%\"}",
             "hints": [
                 "Use a segment tree to perform fast point updates and range queries.",
                 "We need each segment tree node to store the length of the longest substring of that segment consisting of only 1 repeating character.",