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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/count-words-obtained-after-adding-a-letter.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 318,
"dislikes": 65,
"likes": 320,
"dislikes": 66,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Strings Differ by One Character\", \"titleSlug\": \"strings-differ-by-one-character\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Count Substrings That Differ by One Character\", \"titleSlug\": \"count-substrings-that-differ-by-one-character\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Maximum Score From Removing Substrings\", \"titleSlug\": \"maximum-score-from-removing-substrings\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[\"ant\",\"act\",\"tack\"]\n[\"tack\",\"act\",\"acti\"]\n[\"ab\",\"a\"]\n[\"abc\",\"abcd\"]",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"12.7K\", \"totalSubmission\": \"34.4K\", \"totalAcceptedRaw\": 12701, \"totalSubmissionRaw\": 34353, \"acRate\": \"37.0%\"}",
"stats": "{\"totalAccepted\": \"12.9K\", \"totalSubmission\": \"34.7K\", \"totalAcceptedRaw\": 12856, \"totalSubmissionRaw\": 34682, \"acRate\": \"37.1%\"}",
"hints": [
"Which data structure can be used to efficiently check if a string exists in startWords?",
"After appending a letter, all letters of a string can be rearranged in any possible way. How can we use this to reduce our search space while checking if a string in targetWords can be obtained from a string in startWords?"