update

leetcode/originData/minimize-the-difference-between-target-and-chosen-elements.json

@@ -11,8 +11,8 @@
             "translatedContent": null,
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 460,
-            "dislikes": 85,
+            "likes": 485,
+            "dislikes": 90,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Partition Equal Subset Sum\", \"titleSlug\": \"partition-equal-subset-sum\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Closest Subsequence Sum\", \"titleSlug\": \"closest-subsequence-sum\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Maximum Number of Points with Cost\", \"titleSlug\": \"maximum-number-of-points-with-cost\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
             "exampleTestcases": "[[1,2,3],[4,5,6],[7,8,9]]\n13\n[[1],[2],[3]]\n100\n[[1,2,9,8,7]]\n6",
@@ -149,7 +149,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"14.4K\", \"totalSubmission\": \"44K\", \"totalAcceptedRaw\": 14403, \"totalSubmissionRaw\": 43992, \"acRate\": \"32.7%\"}",
+            "stats": "{\"totalAccepted\": \"14.8K\", \"totalSubmission\": \"45.2K\", \"totalAcceptedRaw\": 14775, \"totalSubmissionRaw\": 45211, \"acRate\": \"32.7%\"}",
             "hints": [
                 "The sum of chosen elements will not be too large. Consider using a hash set to record all possible sums while iterating each row.",
                 "Instead of keeping track of all possible sums, since in each row, we are adding positive numbers, only keep those that can be a candidate, not exceeding the target by too much."