Algorithm · Google · Medium
Part 1: Integer Palindrome Check Given an integer x, decide whether its decimal digits form a palindrome — that is, whether the number looks identical when read from left to right and from right to left. Return True in that case and False otherwise. Since a minus sign appears only on the left side, no negative value of x can ever be a palindrome. Aim to reach the answer using arithmetic on the digits themselves rather than by turning x into a string. Example 1: Explanation:…
Checking your access…