Day 3 - Palindrome Number - Leetcode Problem Solved

Day 3 - Palindrome Number - Leetcode Problem Solved

#I4G10DaysOfCodeChallenge - Day 3

The Task

Given an integer x, return true if x is palindrome integer.

An integer is a palindrome when it reads the same backward as forward.

  • For example, 121 is a palindrome while 123 is not.

Example 1:

Input: x = 121
Output: true
Explanation: 121 reads as 121 from left to right and from right to left.

Example 2:

Input: x = -121
Output: false
Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome.

Example 3:

Input: x = 10
Output: false
Explanation: Reads 01 from right to left. Therefore it is not a palindrome.

Constraints:

  • -231 <= x <= 231 - 1

Thought Process

  • First thing, convert the integer into a string. Then split the string into an array of num characters.
  • Reverse the array, then join the reversed array
  • Compare the original converted string with the reversed string