Leetcode Problem 2663. Lexicographically Smallest Beautiful String

2663. Lexicographically Smallest Beautiful String

Leetcode Solutions

Convert the string s into a list of characters for easy manipulation.
Start from the last character of the list and attempt to increment it.
If the incremented character exceeds the kth alphabet, reset it to 'a' and move one character to the left.
If the character is the same as the one before it or two characters before, increment it again.
Repeat steps 3 and 4 until a valid character is found or the beginning of the list is reached.
If a valid character is found, fill the rest of the string to the right with the lexicographically smallest characters that do not form palindromes.
Convert the list back to a string and return it.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen