# Task
 Given a string `str`, find the shortest possible string which can be achieved by adding characters to the end of initial string to make it a palindrome.
# Example
 For `str = "abcdc"`, the output should be `"abcdcba"`.
# Input/Output
 - `[input]` string `str`
    A string consisting of lowercase latin letters.
    Constraints: `3 ≤ str.length ≤ 10`.
 - `[output]` a string
def build_palindrome(s):
    if s == s[::-1]:
        return s
    else:
        for i in range(1,len(s)):
            if s + s[:i][::-1] == (s + s[:i][::-1])[::-1]:
                return s + s[:i][::-1]
        

def build_palindrome(s):
    if s == s[::-1]:
        return s
    else:
        for i in range(1,len(s)):
            if s + s[:i][::-1] == (s + s[:i][::-1])[::-1]:
                return s + s[:i][::-1]
        
