update

leetcode/originData/[no content]meeting-rooms-ii.json

@@ -11,7 +11,7 @@
             "translatedContent": null,
             "isPaidOnly": true,
             "difficulty": "Medium",
-            "likes": 5301,
+            "likes": 5309,
             "dislikes": 104,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Merge Intervals\", \"titleSlug\": \"merge-intervals\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Meeting Rooms\", \"titleSlug\": \"meeting-rooms\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Minimum Number of Arrows to Burst Balloons\", \"titleSlug\": \"minimum-number-of-arrows-to-burst-balloons\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Car Pooling\", \"titleSlug\": \"car-pooling\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -52,7 +52,7 @@
             ],
             "companyTagStats": null,
             "codeSnippets": null,
-            "stats": "{\"totalAccepted\": \"609K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 609022, \"totalSubmissionRaw\": 1230097, \"acRate\": \"49.5%\"}",
+            "stats": "{\"totalAccepted\": \"610.3K\", \"totalSubmission\": \"1.2M\", \"totalAcceptedRaw\": 610278, \"totalSubmissionRaw\": 1232272, \"acRate\": \"49.5%\"}",
             "hints": [
                 "Think about how we would approach this problem in a very simplistic way. We will allocate rooms to meetings that occur earlier in the day v/s the ones that occur later on, right?",
                 "If you've figured out that we have to <b>sort</b> the meetings by their start time, the next thing to think about is how do we do the allocation? <br>There are two scenarios possible here for any meeting. Either there is no meeting room available and a new one has to be allocated, or a meeting room has freed up and this meeting can take place there.",