def print_array_with_markers(arr, pValue):
    out = arr[:pValue] + '«' + arr[pValue] + '»' + arr[pValue+1:]
    return out


def permute_palindrome(st):
    # Create a hashmap to keep track of the characters and their occurrences
    print("\n\tPopulating the hashmap")
    frequencies = {}
    index = 0
    for i in st:
        print("\t\t", print_array_with_markers(st, index), sep="")
        index += 1
        print("\t\tCharacter: ", i, sep="")
        print("\t\tHashmap: ", frequencies, sep="")
        if i in frequencies:
            print("\t\t\t", i, " is already present in the hashmap", sep="")
            print("\t\t\tUpdating its frequency  ⟶ ", sep="", end="")
            frequencies[i] += 1
            print(frequencies, "\n", sep="")
        else:
            print("\t\t\t", i, " is not present in the hashmap", sep="")
            print("\t\t\tSetting its frequency = 1  ⟶ ", sep="", end="")
            frequencies[i] = 1
            print(frequencies, "\n", sep="")
    return None


# Driver Code
def main():
    str_array = ["baefeab", "abc", "xzz", "jjadd", "kllk"]
    for i in range(len(str_array)):
        print(i + 1, ".\tInput string: ", str_array[i], sep="")
        result = permute_palindrome(str_array[i])
        if result:
            print("\n\tInput string has permutations that are palindromes")
        else:
            print("\n\tInput string does not have a permutation that's a palindrome")
        print("-"*100)


if __name__ == "__main__":
    main()