update

leetcode/originData/find-minimum-in-rotated-sorted-array.json

@@ -11,8 +11,8 @@
             "translatedContent": null,
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 6351,
-            "dislikes": 376,
+            "likes": 6591,
+            "dislikes": 387,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Search in Rotated Sorted Array\", \"titleSlug\": \"search-in-rotated-sorted-array\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Find Minimum in Rotated Sorted Array II\", \"titleSlug\": \"find-minimum-in-rotated-sorted-array-ii\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
             "exampleTestcases": "[3,4,5,1,2]\n[4,5,6,7,0,1,2]\n[11,13,15,17]",
@@ -143,7 +143,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"877.1K\", \"totalSubmission\": \"1.8M\", \"totalAcceptedRaw\": 877052, \"totalSubmissionRaw\": 1834706, \"acRate\": \"47.8%\"}",
+            "stats": "{\"totalAccepted\": \"903.8K\", \"totalSubmission\": \"1.9M\", \"totalAcceptedRaw\": 903751, \"totalSubmissionRaw\": 1886816, \"acRate\": \"47.9%\"}",
             "hints": [
                 "Array was originally in ascending order. Now that the array is rotated, there would be a point in the array where there is a small deflection from the increasing sequence. eg. The array would be something like [4, 5, 6, 7, 0, 1, 2].",
                 "You can divide the search space into two and see which direction to go.\r\nCan you think of an algorithm which has O(logN) search complexity?",