update

leetcode/originData/minimum-degree-of-a-connected-trio-in-a-graph.json

@@ -11,8 +11,8 @@
             "translatedContent": null,
             "isPaidOnly": false,
             "difficulty": "Hard",
-            "likes": 184,
-            "dislikes": 203,
+            "likes": 193,
+            "dislikes": 215,
             "isLiked": null,
             "similarQuestions": "[]",
             "exampleTestcases": "6\n[[1,2],[1,3],[3,2],[4,1],[5,2],[3,6]]\n7\n[[1,3],[4,1],[4,3],[2,5],[5,6],[6,7],[7,5],[2,6]]",
@@ -137,7 +137,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"14.7K\", \"totalSubmission\": \"35.4K\", \"totalAcceptedRaw\": 14668, \"totalSubmissionRaw\": 35364, \"acRate\": \"41.5%\"}",
+            "stats": "{\"totalAccepted\": \"15.3K\", \"totalSubmission\": \"36.9K\", \"totalAcceptedRaw\": 15307, \"totalSubmissionRaw\": 36925, \"acRate\": \"41.5%\"}",
             "hints": [
                 "Consider a trio with nodes u, v, and w. The degree of the trio is just degree(u) + degree(v) + degree(w) - 6. The -6 comes from subtracting the edges u-v, u-w, and v-w, which are counted twice each in the vertex degree calculation.",
                 "To get the trios (u,v,w), you can iterate on u, then iterate on each w,v such that w and v are neighbors of u and are neighbors of each other."