update

leetcode/originData/[no content]choose-numbers-from-two-arrays-in-range.json

@@ -11,8 +11,8 @@
             "translatedContent": null,
             "isPaidOnly": true,
             "difficulty": "Hard",
-            "likes": 13,
-            "dislikes": 2,
+            "likes": 15,
+            "dislikes": 3,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Intersection of Two Arrays\", \"titleSlug\": \"intersection-of-two-arrays\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Intersection of Two Arrays II\", \"titleSlug\": \"intersection-of-two-arrays-ii\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Minimum XOR Sum of Two Arrays\", \"titleSlug\": \"minimum-xor-sum-of-two-arrays\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Minimize Product Sum of Two Arrays\", \"titleSlug\": \"minimize-product-sum-of-two-arrays\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
             "exampleTestcases": "[1,2,5]\n[2,6,3]\n[0,1]\n[1,0]",
@@ -34,7 +34,7 @@
             ],
             "companyTagStats": null,
             "codeSnippets": null,
-            "stats": "{\"totalAccepted\": \"410\", \"totalSubmission\": \"767\", \"totalAcceptedRaw\": 410, \"totalSubmissionRaw\": 767, \"acRate\": \"53.5%\"}",
+            "stats": "{\"totalAccepted\": \"446\", \"totalSubmission\": \"827\", \"totalAcceptedRaw\": 446, \"totalSubmissionRaw\": 827, \"acRate\": \"53.9%\"}",
             "hints": [
                 "If you know the possible sums you can get for a range [l, r], how can you use this information to calculate the possible sums you can get for a range [l, r + 1]?",
                 "For the range [l, r], if it is possible to choose elements such that the sum of elements you picked from nums1 is x and the sum of elements you picked from nums2 is y, then (x + nums1[r + 1], y) and (x, y + nums2[r + 1]) are possible sums you can get in the range [l, r + 1].",