update

leetcode/originData/ways-to-split-array-into-three-subarrays.json

@@ -11,8 +11,8 @@
             "translatedContent": null,
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 741,
-            "dislikes": 69,
+            "likes": 787,
+            "dislikes": 75,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Number of Ways to Divide a Long Corridor\", \"titleSlug\": \"number-of-ways-to-divide-a-long-corridor\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
             "exampleTestcases": "[1,1,1]\n[1,2,2,2,5,0]\n[3,2,1]",
@@ -137,7 +137,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"18.3K\", \"totalSubmission\": \"59K\", \"totalAcceptedRaw\": 18288, \"totalSubmissionRaw\": 59018, \"acRate\": \"31.0%\"}",
+            "stats": "{\"totalAccepted\": \"19.3K\", \"totalSubmission\": \"61.5K\", \"totalAcceptedRaw\": 19308, \"totalSubmissionRaw\": 61491, \"acRate\": \"31.4%\"}",
             "hints": [
                 "Create a prefix array to efficiently find the sum of subarrays.",
                 "As we are dividing the array into three subarrays, there are two \"walls\". Iterate over the right wall positions and find where the left wall could be for each right wall position.",