Java developer, urgent task for an hour (simple string handle function), long term opportunity

This is task
#################################################
Almost Palindrome

Problem Description

A String is an almost-palindrome if, by changing only one character, you can make it into a palindrome.

Create a function that returns true if the string is an almost-palindrome and false otherwise.

If the result is an almost-palindrome, then before returning print two strings that highlight the difference.

Examples:

almostPalindrome("racecat") -> true
// replace 't' with 'r'

almostPalindrome("tart") -> true
// replace 'r' with 'a'

almostPalindrome("racecot") -> false
// too many differences

almostPalindrome("racecar") -> false
// can't be an exact palindrome
##########################################

let me know if you can do the task in an hour.