coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/valid-arrangement-of-pairs.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 232,
"likes": 242,
"dislikes": 10,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Reconstruct Itinerary\", \"titleSlug\": \"reconstruct-itinerary\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Find if Path Exists in Graph\", \"titleSlug\": \"find-if-path-exists-in-graph\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"4.3K\", \"totalSubmission\": \"10.8K\", \"totalAcceptedRaw\": 4286, \"totalSubmissionRaw\": 10764, \"acRate\": \"39.8%\"}",
"stats": "{\"totalAccepted\": \"4.5K\", \"totalSubmission\": \"11.2K\", \"totalAcceptedRaw\": 4475, \"totalSubmissionRaw\": 11178, \"acRate\": \"40.0%\"}",
"hints": [
"Could you convert this into a graph problem?",
"Consider the pairs as edges and each number as a node.",