diff --git a/isNumberPalindrome.js b/isNumberPalindrome.js
index 699a785..06c2921 100644
--- a/isNumberPalindrome.js
+++ b/isNumberPalindrome.js
@@ -32,3 +32,20 @@ const isNumberPalindrome = (number) => {
   return reversed === number;
 }
  */
+
+ const isNumberPalindrome = (num) => {
+  num = num.toString();
+  let rev = [];
+  for (let i = num.length; i > 0; i--) {
+     let copy = num.slice(0, i);
+     rev.push(copy % 10);
+  }
+  if (rev.join('') === num) {
+    return true;
+  } else {
+    return false;
+  }
+
+ }
+
+ console.log(isNumberPalindrome(1331))
diff --git a/longestCommonPrefix.js b/longestCommonPrefix.js
index 99bd9f6..06f927e 100644
--- a/longestCommonPrefix.js
+++ b/longestCommonPrefix.js
@@ -39,3 +39,22 @@ const longestCommonPrefix = arrayOfStrings => {
         is empty)
  };
 */
+
+const longestCommonPrefix = arrayofStrings => {
+  let prefix = arrayofStrings[0];
+  let i = prefix.length;
+  for (let j = arrayofStrings.length - 1; j > 0; j--) {
+    for (let i = prefix.length; i >= 0; i--) {
+      if (arrayofStrings[j].indexOf(prefix, 0, prefix.length - 1) === -1) {
+        prefix = prefix.slice(0, i);
+      } else if (arrayofStrings[j].indexOf(prefix, 0, prefix.length - 1) >= 0) {
+        if (arrayofStrings[j - 1].indexOf(prefix, 0, prefix.length - 1) >= 0) {
+          return "match on prefix " + prefix + ' with word ' + arrayofStrings[j];
+        }
+      }
+    }
+  }
+}
+
+console.log(longestCommonPrefix(['flat', 'flatulance', 'flair']))
+console.log(longestCommonPrefix(['abcdefgh', 'aefghijk', 'abcefgh']))
\ No newline at end of file