coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51:41 +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

6
leetcode/originData/remove-palindromic-subsequences.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 187,
"dislikes": 292,
"likes": 192,
"dislikes": 308,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "\"ababa\"\n\"abb\"\n\"baabb\"",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"53.4K\", \"totalSubmission\": \"76.8K\", \"totalAcceptedRaw\": 53398, \"totalSubmissionRaw\": 76801, \"acRate\": \"69.5%\"}",
"stats": "{\"totalAccepted\": \"53.9K\", \"totalSubmission\": \"77.6K\", \"totalAcceptedRaw\": 53941, \"totalSubmissionRaw\": 77553, \"acRate\": \"69.6%\"}",
"hints": [
"Use the fact that string contains only 2 characters.",
"Are subsequences composed of only one type of letter always palindrome strings ?"