1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
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

View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 216,
"likes": 220,
"dislikes": 11,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Maximum XOR With an Element From Array\", \"titleSlug\": \"maximum-xor-with-an-element-from-array\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"3.2K\", \"totalSubmission\": \"8.2K\", \"totalAcceptedRaw\": 3209, \"totalSubmissionRaw\": 8165, \"acRate\": \"39.3%\"}",
"stats": "{\"totalAccepted\": \"3.3K\", \"totalSubmission\": \"8.3K\", \"totalAcceptedRaw\": 3254, \"totalSubmissionRaw\": 8320, \"acRate\": \"39.1%\"}",
"hints": [
"How can we use a trie to store all the XOR values in the path from a node to the root?",
"How can we dynamically add the XOR values with a DFS search?"