For this Question: Given a string s, Print <b>true</b> if the string can be palindrome after deleting at most one character from it, otherwise print <b>false</b>.The first line of the input contains a string s.

<b>Constraints</b>
1 <= s. length() <= 1e5Print "true" if the string can be made palindromic after deleting atmost one character from it, otherwise "false".<b>Sample Input 1:</b>
aba
<b>Sample Output 1:</b>
true 
<b>Explanation:</b>
In the string "aba" if we remove b then we can get a palindromic string "aa" hence Output is True

<b>Sample Input 2:</b>
abba
<b>Sample Output 2:</b>
true
<b>Explanation:</b>
The string is already a palindrome so there is no need to remove any character hence the Output is True., I have written this Solution Code: def isPalindrome(string: str, low: int, high: int) -> bool:
	while low < high:
		if string[low] != string[high]:
			return False
		low += 1
		high -= 1
	return True
def possiblepalinByRemovingOneChar(string: str) -> int:
	low = 0
	high = len(string) - 1
	while low < high:
		if string[low] == string[high]:
			low += 1
			high -= 1
		else:
			if isPalindrome(string, low + 1, high):
				return low
			if isPalindrome(string, low, high - 1):
				return high
			return -1
	return -2
string = input()
idx = possiblepalinByRemovingOneChar(string)
if idx == -1:
	print("false")
else:
	print("true"), In this Programming Language: Python, Now tell me if this Code is compilable or not?