I have the following task:
Given a string S of len N, returns any palindrome (i.e. a string that reads the same both forwards and backward) that can be obtained by re
