update

leetcode/originData/insufficient-nodes-in-root-to-leaf-paths.json

@@ -11,8 +11,8 @@
             "translatedContent": null,
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 399,
-            "dislikes": 544,
+            "likes": 411,
+            "dislikes": 551,
             "isLiked": null,
             "similarQuestions": "[]",
             "exampleTestcases": "[1,2,3,4,-99,-99,7,8,9,-99,-99,12,13,-99,14]\n1\n[5,4,8,11,null,17,4,7,1,null,null,5,3]\n22\n[1,2,-3,-5,null,4,null]\n-1",
@@ -149,7 +149,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"24.8K\", \"totalSubmission\": \"47.8K\", \"totalAcceptedRaw\": 24807, \"totalSubmissionRaw\": 47806, \"acRate\": \"51.9%\"}",
+            "stats": "{\"totalAccepted\": \"25.3K\", \"totalSubmission\": \"48.6K\", \"totalAcceptedRaw\": 25254, \"totalSubmissionRaw\": 48642, \"acRate\": \"51.9%\"}",
             "hints": [
                 "Consider a DFS traversal of the tree.  You can keep track of the current path sum from root to this node, and you can also use DFS to return the minimum value of any path from this node to the leaf.  This will tell you if this node is insufficient."
             ],