{"blocks": [{"key": "f048eb26", "text": "Question", "type": "header-two", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "d4541723", "text": "Given a palindromic string of lowercase English letters (1 \u2264 length \u2264 1,000), replace exactly one character so that the result is no longer a palindrome and is the lexicographically smallest string possible. Return the new string, or an empty string if it cannot be done.", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "cd026833", "text": "Describe your algorithm, key edge cases (e.g., single-character input), and analyze time and space complexity.", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}], "entityMap": {}}