update

leetcode/originData/maximum-sum-circular-subarray.json

@@ -11,8 +11,8 @@
             "translatedContent": null,
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 2965,
-            "dislikes": 136,
+            "likes": 3060,
+            "dislikes": 139,
             "isLiked": null,
             "similarQuestions": "[]",
             "exampleTestcases": "[1,-2,3,-2]\n[5,-3,5]\n[-3,-2,-3]",
@@ -161,7 +161,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"111.1K\", \"totalSubmission\": \"300.7K\", \"totalAcceptedRaw\": 111093, \"totalSubmissionRaw\": 300669, \"acRate\": \"36.9%\"}",
+            "stats": "{\"totalAccepted\": \"114.5K\", \"totalSubmission\": \"308.5K\", \"totalAcceptedRaw\": 114526, \"totalSubmissionRaw\": 308536, \"acRate\": \"37.1%\"}",
             "hints": [
                 "For those of you who are familiar with the <b>Kadane's algorithm</b>, think in terms of that. For the newbies, Kadane's algorithm is used to finding the maximum sum subarray from a given array. This problem is a twist on that idea and it is advisable to read up on that algorithm first before starting this problem. Unless you already have a great algorithm brewing up in your mind in which case, go right ahead!",
                 "What is an alternate way of representing a circular array so that it appears to be a straight array?\r\nEssentially, there are two cases of this problem that we need to take care of. Let's look at the figure below to understand those two cases:\r\n\r\n<br>\r\n<img src=\"https://assets.leetcode.com/uploads/2019/10/20/circular_subarray_hint_1.png\" width=\"700\"/>",