update

leetcode/originData/create-binary-tree-from-descriptions.json

@@ -11,8 +11,8 @@
             "translatedContent": null,
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 297,
-            "dislikes": 7,
+            "likes": 350,
+            "dislikes": 8,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Convert Sorted List to Binary Search Tree\", \"titleSlug\": \"convert-sorted-list-to-binary-search-tree\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Number Of Ways To Reconstruct A Tree\", \"titleSlug\": \"number-of-ways-to-reconstruct-a-tree\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
             "exampleTestcases": "[[20,15,1],[20,17,0],[50,20,1],[50,80,0],[80,19,1]]\n[[1,2,1],[2,3,0],[3,4,1]]",
@@ -167,7 +167,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"12.9K\", \"totalSubmission\": \"18.4K\", \"totalAcceptedRaw\": 12903, \"totalSubmissionRaw\": 18422, \"acRate\": \"70.0%\"}",
+            "stats": "{\"totalAccepted\": \"14.4K\", \"totalSubmission\": \"20.4K\", \"totalAcceptedRaw\": 14373, \"totalSubmissionRaw\": 20440, \"acRate\": \"70.3%\"}",
             "hints": [
                 "Could you represent and store the descriptions more efficiently?",
                 "Could you find the root node?",