valid-palindrome solution

Author: RiaOh

number-of-1-bits/RiaOh.js

@@ -0,0 +1,15 @@
+/**
+ * @param {number} n
+ * @return {number}
+ */
+var hammingWeight = function (n) {
+  const binary = n.toString(2);
+  const arr = [...binary];
+  let count = 0;
+  arr.map((num) => {
+    if (num === "1") {
+      count++;
+    }
+  });
+  return count;
+};

valid-palindrome/RiaOh.js

@@ -0,0 +1,30 @@
+/**
+ * @param {string} s
+ * @return {boolean}
+ */
+var isPalindrome = function (s) {
+  const arr = [...s];
+  let text = "";
+  for (let i = 0; i < arr.length; i++) {
+    if (isAlphabet(arr[i]) === true && arr[i] !== " ") {
+      text = text + arr[i].toLowerCase();
+    } else if (isNumeric(arr[i]) === true && arr[i] !== " ") {
+      text = text + arr[i];
+    }
+  }
+  console.log("text -->", text);
+  for (let i = 0; i < text.length / 2; i++) {
+    if (text[i] !== text[text.length - 1 - i]) {
+      return false;
+    }
+  }
+  return true;
+};
+
+function isAlphabet(char) {
+  return /[a-zA-Z]/.test(char);
+}
+
+function isNumeric(str) {
+  return !isNaN(str);
+}