update

leetcode/originData/sliding-window-median.json

@@ -11,8 +11,8 @@
             "translatedContent": null,
             "isPaidOnly": false,
             "difficulty": "Hard",
-            "likes": 2070,
-            "dislikes": 124,
+            "likes": 2126,
+            "dislikes": 131,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Find Median from Data Stream\", \"titleSlug\": \"find-median-from-data-stream\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
             "exampleTestcases": "[1,3,-1,-3,5,3,6,7]\n3\n[1,2,3,4,2,3,1,4,2]\n3",
@@ -155,7 +155,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"101.4K\", \"totalSubmission\": \"248.6K\", \"totalAcceptedRaw\": 101409, \"totalSubmissionRaw\": 248649, \"acRate\": \"40.8%\"}",
+            "stats": "{\"totalAccepted\": \"103.6K\", \"totalSubmission\": \"253.5K\", \"totalAcceptedRaw\": 103629, \"totalSubmissionRaw\": 253537, \"acRate\": \"40.9%\"}",
             "hints": [
                 "The simplest of solutions comes from the basic idea of finding the median given a set of numbers. We know that by definition, a median is the center element (or an average of the two center elements). Given an unsorted list of numbers, how do we find the median element? If you know the answer to this question, can we extend this idea to every sliding window that we come across in the array?",
                 "Is there a better way to do what we are doing in the above hint? Don't you think there is duplication of calculation being done there? Is there some sort of optimization that we can do to achieve the same result? This approach is merely a modification of the basic approach except that it simply reduces duplication of calculations once done.",