update

leetcode/originData/minimum-number-of-work-sessions-to-finish-the-tasks.json

@@ -11,8 +11,8 @@
             "translatedContent": null,
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 486,
-            "dislikes": 28,
+            "likes": 508,
+            "dislikes": 32,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Smallest Sufficient Team\", \"titleSlug\": \"smallest-sufficient-team\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Find Minimum Time to Finish All Jobs\", \"titleSlug\": \"find-minimum-time-to-finish-all-jobs\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
             "exampleTestcases": "[1,2,3]\n3\n[3,1,3,1,1]\n8\n[1,2,3,4,5]\n15",
@@ -161,7 +161,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"11.1K\", \"totalSubmission\": \"35.3K\", \"totalAcceptedRaw\": 11120, \"totalSubmissionRaw\": 35338, \"acRate\": \"31.5%\"}",
+            "stats": "{\"totalAccepted\": \"11.6K\", \"totalSubmission\": \"36.7K\", \"totalAcceptedRaw\": 11585, \"totalSubmissionRaw\": 36693, \"acRate\": \"31.6%\"}",
             "hints": [
                 "Try all possible ways of assignment.",
                 "If we can store the assignments in form of a state then we can reuse that state and solve the problem in a faster way."