# \*1216. Valid Palindrome III

[https://leetcode.com/problems/valid-palindrome-iii/](https://leetcode.com/problems/valid-palindrome-iii/)

## solution

```python
# https://www.geeksforgeeks.org/find-if-string-is-k-palindrome-or-not/
# 680 的更普遍情况, 编辑距离72的变种, 516一样的设计
# dp[i][j]: 字符串中i到j修正成回文串所需的最少操作次数, 子串 -> 子序列

```

时间复杂度：O()\
空间复杂度：O()

## follow up

[回文类](../01_two_pointers/5.-longest-palindromic-substring)
