Palindrome number first solution inefficient 0(n2)

Author: Gabrieldev-web-coder

leetcode/PalindromeNumber.js

@@ -0,0 +1,5 @@
+function isPalindrome(x) {
+  const s = Number(String(x).split("").reverse().join(""));
+  return x === s;
+}
+//My first iteration over Palindrome number, quadratic time complexity 0(n2)