Answer: Solved using java but lmk if you want another language
Step-by-step explanation:
//Java
public class Palindrom{
public static boolean isPalindrome(String s){
String reverse = "";
for(int j = s.length() - 1; j>= 0; j--){
reverse+= s.charAt(j);
}
if(s.equals(reverse)){
return true;
}
return false
}
}