update

leetcode/originData/course-schedule.json

@@ -11,8 +11,8 @@
             "translatedContent": null,
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 8853,
-            "dislikes": 356,
+            "likes": 9083,
+            "dislikes": 364,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Course Schedule II\", \"titleSlug\": \"course-schedule-ii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Graph Valid Tree\", \"titleSlug\": \"graph-valid-tree\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Minimum Height Trees\", \"titleSlug\": \"minimum-height-trees\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Course Schedule III\", \"titleSlug\": \"course-schedule-iii\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
             "exampleTestcases": "2\n[[1,0]]\n2\n[[1,0],[0,1]]",
@@ -155,7 +155,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"828.4K\", \"totalSubmission\": \"1.8M\", \"totalAcceptedRaw\": 828438, \"totalSubmissionRaw\": 1841471, \"acRate\": \"45.0%\"}",
+            "stats": "{\"totalAccepted\": \"849.4K\", \"totalSubmission\": \"1.9M\", \"totalAcceptedRaw\": 849448, \"totalSubmissionRaw\": 1885599, \"acRate\": \"45.0%\"}",
             "hints": [
                 "This problem is equivalent to finding if a cycle exists in a directed graph. If a cycle exists, no topological ordering exists and therefore it will be impossible to take all courses.",
                 "<a href=\"https://class.coursera.org/algo-003/lecture/52\" target=\"_blank\">Topological Sort via DFS</a> - A great video tutorial (21 minutes) on Coursera explaining the basic concepts of Topological Sort.",