update

leetcode/originData/find-all-numbers-disappeared-in-an-array.json

@@ -11,8 +11,8 @@
             "translatedContent": null,
             "isPaidOnly": false,
             "difficulty": "Easy",
-            "likes": 6327,
-            "dislikes": 373,
+            "likes": 6440,
+            "dislikes": 379,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"First Missing Positive\", \"titleSlug\": \"first-missing-positive\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Find All Duplicates in an Array\", \"titleSlug\": \"find-all-duplicates-in-an-array\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Find Unique Binary String\", \"titleSlug\": \"find-unique-binary-string\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Append K Integers With Minimal Sum\", \"titleSlug\": \"append-k-integers-with-minimal-sum\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
             "exampleTestcases": "[4,3,2,7,8,2,3,1]\n[1,1]",
@@ -143,7 +143,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"553.7K\", \"totalSubmission\": \"939.1K\", \"totalAcceptedRaw\": 553655, \"totalSubmissionRaw\": 939068, \"acRate\": \"59.0%\"}",
+            "stats": "{\"totalAccepted\": \"565.1K\", \"totalSubmission\": \"957K\", \"totalAcceptedRaw\": 565062, \"totalSubmissionRaw\": 957034, \"acRate\": \"59.0%\"}",
             "hints": [
                 "This is a really easy problem if you decide to use additional memory. For those trying to write an initial solution using additional memory, think <b>counters!</b>",
                 "However, the trick really is to not use any additional space than what is already available to use. Sometimes, multiple passes over the input array help find the solution. However, there's an interesting piece of information in this problem that makes it easy to re-use the input array itself for the solution.",