update

leetcode/originData/[no content]tree-diameter.json

@@ -11,7 +11,7 @@
             "translatedContent": null,
             "isPaidOnly": true,
             "difficulty": "Medium",
-            "likes": 590,
+            "likes": 602,
             "dislikes": 13,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Count Subtrees With Max Distance Between Cities\", \"titleSlug\": \"count-subtrees-with-max-distance-between-cities\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
@@ -36,11 +36,23 @@
                     "slug": "breadth-first-search",
                     "translatedName": null,
                     "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Graph",
+                    "slug": "graph",
+                    "translatedName": null,
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Topological Sort",
+                    "slug": "topological-sort",
+                    "translatedName": null,
+                    "__typename": "TopicTagNode"
                 }
             ],
             "companyTagStats": null,
             "codeSnippets": null,
-            "stats": "{\"totalAccepted\": \"24.9K\", \"totalSubmission\": \"39.9K\", \"totalAcceptedRaw\": 24893, \"totalSubmissionRaw\": 39936, \"acRate\": \"62.3%\"}",
+            "stats": "{\"totalAccepted\": \"25.4K\", \"totalSubmission\": \"40.8K\", \"totalAcceptedRaw\": 25414, \"totalSubmissionRaw\": 40802, \"acRate\": \"62.3%\"}",
             "hints": [
                 "Start at any node A and traverse the tree to find the furthest node from it, let's call it B.",
                 "Having found the furthest node B, traverse the tree from B to find the furthest node from it, lets call it C.",