From a2dabf12cf7b9c3c6de4d7a8f3a928992836b524 Mon Sep 17 00:00:00 2001
From: Kav <kamarasinghe@nevada.unr.edu>
Date: Tue, 13 Mar 2018 17:46:20 +0000
Subject: [PATCH 1/3] Solution for isNumberPalindrome.js

---
 isNumberPalindrome.js | 21 +++++++++++++++++++++
 1 file changed, 21 insertions(+)

diff --git a/isNumberPalindrome.js b/isNumberPalindrome.js
index 699a785..e99cdfe 100644
--- a/isNumberPalindrome.js
+++ b/isNumberPalindrome.js
@@ -32,3 +32,24 @@ const isNumberPalindrome = (number) => {
   return reversed === number;
 }
  */
+ 
+const isNumberPalindrome = (number) => {
+  let reversed = '';
+  let digit;
+  
+  let copyOfNum = number;
+  while(copyOfNum > 0) {
+    digit = (copyOfNum % 10);
+    // reversed += (reversed * 10) + digit;
+    reversed += digit;
+    copyOfNum = Math.floor(copyOfNum / 10);
+  }
+  // copy input number to build reversed number
+  // init reversed number and digit
+  // iterate until copy is 0 or less
+    // current digit is copy % 10
+    // multiply reversed number by 10 and add the digit
+    // divide the number copy by 10 and remove decimals
+
+  return Number(reversed) === number;
+};

From 73b2ad650cbf99ea5d4063cfefeb555d070c3622 Mon Sep 17 00:00:00 2001
From: Kav <kamarasinghe@nevada.unr.edu>
Date: Tue, 13 Mar 2018 18:04:57 +0000
Subject: [PATCH 2/3] Solution for longestCommonPrefix.js

---
 longestCommonPrefix.js | 27 +++++++++++++++++++++++++++
 1 file changed, 27 insertions(+)

diff --git a/longestCommonPrefix.js b/longestCommonPrefix.js
index 99bd9f6..621a510 100644
--- a/longestCommonPrefix.js
+++ b/longestCommonPrefix.js
@@ -39,3 +39,30 @@ const longestCommonPrefix = arrayOfStrings => {
         is empty)
  };
 */
+
+const getPrefixFromWord = (arrWord, word) => {
+  for (let i = arrWord.length - 1; i !== -1; i--) {
+    let prefix = arrWord.slice(0, i + 1);
+    
+    if (word.indexOf(prefix) > -1) {
+      return prefix;
+    }
+  }
+  
+  return '';
+};
+
+const longestCommonPrefix = (arrayOfStrings, word) => {
+  let longestPrefix = '';
+  
+  for (let i = 0; i < arrayOfStrings.length; i++) {
+    let arrWord = arrayOfStrings[i];
+    let prefix = getPrefixFromWord(arrWord, word);
+    
+    if (prefix.length > longestPrefix.length) {
+      longestPrefix = prefix;
+    }
+  }
+  
+  return longestPrefix;
+};
\ No newline at end of file

From 49940888914fbda23ce98d580124cb55e1b7e815 Mon Sep 17 00:00:00 2001
From: Kav <kamarasinghe@nevada.unr.edu>
Date: Tue, 13 Mar 2018 18:13:46 +0000
Subject: [PATCH 3/3] Removed the comments from isNumberPalindrome function

---
 isNumberPalindrome.js | 6 ------
 1 file changed, 6 deletions(-)

diff --git a/isNumberPalindrome.js b/isNumberPalindrome.js
index e99cdfe..460bd67 100644
--- a/isNumberPalindrome.js
+++ b/isNumberPalindrome.js
@@ -44,12 +44,6 @@ const isNumberPalindrome = (number) => {
     reversed += digit;
     copyOfNum = Math.floor(copyOfNum / 10);
   }
-  // copy input number to build reversed number
-  // init reversed number and digit
-  // iterate until copy is 0 or less
-    // current digit is copy % 10
-    // multiply reversed number by 10 and add the digit
-    // divide the number copy by 10 and remove decimals
 
   return Number(reversed) === number;
 };