update

leetcode/originData/number-of-restricted-paths-from-first-to-last-node.json

@@ -11,8 +11,8 @@
             "translatedContent": null,
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 564,
-            "dislikes": 98,
+            "likes": 580,
+            "dislikes": 102,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"All Ancestors of a Node in a Directed Acyclic Graph\", \"titleSlug\": \"all-ancestors-of-a-node-in-a-directed-acyclic-graph\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
             "exampleTestcases": "5\n[[1,2,3],[1,3,3],[2,3,1],[1,4,2],[5,2,2],[3,5,1],[5,4,10]]\n7\n[[1,3,1],[4,1,2],[7,3,4],[2,5,3],[5,6,1],[6,7,2],[7,5,3],[2,6,4]]",
@@ -161,7 +161,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"12.2K\", \"totalSubmission\": \"31.9K\", \"totalAcceptedRaw\": 12244, \"totalSubmissionRaw\": 31852, \"acRate\": \"38.4%\"}",
+            "stats": "{\"totalAccepted\": \"12.6K\", \"totalSubmission\": \"32.7K\", \"totalAcceptedRaw\": 12604, \"totalSubmissionRaw\": 32661, \"acRate\": \"38.6%\"}",
             "hints": [
                 "Run a Dijkstra from node numbered n to compute distance from the last node.",
                 "Consider all edges [u, v] one by one and direct them such that distance of u to n > distance of v to n. If both u and v are at the same distance from n, discard this edge.",