Palindromi

s = input()

def is_palindrome(s):
    length = len(s)

    for i in range(length // 2):
      
        if s[i] != s[length - i - 1]:
            return 0
        
    return 1

step = 1
for char in s:
    idx = len(s)-step

    if char != s[idx]:
        print(f"Askel = {step}")
        s = s[:idx] + char + s[idx+1:]
        print(s)

    if s == s[::-1]:
        break

    step += 1

print(step)

Test 1 (public)

Verdict: WRONG ANSWER

Test 2 (public)

Verdict: WRONG ANSWER

Test 3 (public)

Verdict: WRONG ANSWER

Test 4 (public)

Verdict: WRONG ANSWER

Test 5 (public)

Verdict: WRONG ANSWER

Test 6 (public)

Verdict: WRONG ANSWER

Test 7 (public)

Verdict: WRONG ANSWER

Test 8 (public)

Verdict: WRONG ANSWER

Test 9 (public)

Verdict: WRONG ANSWER

Test 10 (public)

Verdict: WRONG ANSWER