update

leetcode/originData/find-all-people-with-secret.json

@@ -11,8 +11,8 @@
             "translatedContent": null,
             "isPaidOnly": false,
             "difficulty": "Hard",
-            "likes": 402,
-            "dislikes": 19,
+            "likes": 436,
+            "dislikes": 20,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Reachable Nodes In Subdivided Graph\", \"titleSlug\": \"reachable-nodes-in-subdivided-graph\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
             "exampleTestcases": "6\n[[1,2,5],[2,3,8],[1,5,10]]\n1\n4\n[[3,1,3],[1,2,2],[0,3,3]]\n3\n5\n[[3,4,2],[1,2,1],[2,3,1]]\n1",
@@ -161,7 +161,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"11.7K\", \"totalSubmission\": \"36K\", \"totalAcceptedRaw\": 11712, \"totalSubmissionRaw\": 35955, \"acRate\": \"32.6%\"}",
+            "stats": "{\"totalAccepted\": \"13.2K\", \"totalSubmission\": \"39.8K\", \"totalAcceptedRaw\": 13220, \"totalSubmissionRaw\": 39841, \"acRate\": \"33.2%\"}",
             "hints": [
                 "Could you model all the meetings happening at the same time as a graph?",
                 "What data structure can you use to efficiently share the secret?",