1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-09 01:11:42 +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

@@ -12,7 +12,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Hard",
"likes": 39,
"likes": 42,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"2K\", \"totalSubmission\": \"3.6K\", \"totalAcceptedRaw\": 1988, \"totalSubmissionRaw\": 3603, \"acRate\": \"55.2%\"}",
"stats": "{\"totalAccepted\": \"2.1K\", \"totalSubmission\": \"3.8K\", \"totalAcceptedRaw\": 2104, \"totalSubmissionRaw\": 3760, \"acRate\": \"56.0%\"}",
"hints": [
"Can you reduce this problem to a classic problem?",
"The problem is equivalent to finding any palindromic subsequence of length at least N-K where N is the length of the string.",