mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 07:21:40 +08:00
update
This commit is contained in:
@@ -11,7 +11,7 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": true,
|
||||
"difficulty": "Hard",
|
||||
"likes": 445,
|
||||
"likes": 495,
|
||||
"dislikes": 6,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Valid Palindrome II\", \"titleSlug\": \"valid-palindrome-ii\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
|
||||
@@ -34,7 +34,7 @@
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"31.7K\", \"totalSubmission\": \"62.1K\", \"totalAcceptedRaw\": 31726, \"totalSubmissionRaw\": 62142, \"acRate\": \"51.1%\"}",
|
||||
"stats": "{\"totalAccepted\": \"33.9K\", \"totalSubmission\": \"66.9K\", \"totalAcceptedRaw\": 33945, \"totalSubmissionRaw\": 66907, \"acRate\": \"50.7%\"}",
|
||||
"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.",
|
||||
|
Reference in New Issue
Block a user