coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +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/minimum-insertion-steps-to-make-a-string-palindrome.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 1629,
"dislikes": 25,
"likes": 1706,
"dislikes": 26,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Minimum Number of Moves to Make Palindrome\", \"titleSlug\": \"minimum-number-of-moves-to-make-palindrome\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
"exampleTestcases": "\"zzazz\"\n\"mbadm\"\n\"leetcode\"",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"44.5K\", \"totalSubmission\": \"70.2K\", \"totalAcceptedRaw\": 44471, \"totalSubmissionRaw\": 70172, \"acRate\": \"63.4%\"}",
"stats": "{\"totalAccepted\": \"46.3K\", \"totalSubmission\": \"72.8K\", \"totalAcceptedRaw\": 46341, \"totalSubmissionRaw\": 72789, \"acRate\": \"63.7%\"}",
"hints": [
"Is dynamic programming suitable for this problem ?",
"If we know the longest palindromic sub-sequence is x and the length of the string is n then, what is the answer to this problem? It is n - x as we need n - x insertions to make the remaining characters also palindrome."