Add solution #214

Author: JoshCrozier

README.md

@@ -61,6 +61,7 @@
 191|[Number of 1 Bits](./0191-number-of-1-bits.js)|Easy|
 203|[Remove Linked List Elements](./0203-remove-linked-list-elements.js)|Easy|
 206|[Reverse Linked List](./0206-reverse-linked-list.js)|Easy|
+214|[Shortest Palindrome](./0214-shortest-palindrome.js)|Hard|
 217|[Contains Duplicate](./0217-contains-duplicate.js)|Easy|
 219|[Contains Duplicate II](./0219-contains-duplicate-ii.js)|Easy|
 225|[Implement Stack using Queues](./0225-implement-stack-using-queues.js)|Easy|

solutions/0214-shortest-palindrome.js

@@ -0,0 +1,24 @@
+/**
+ * 214. Shortest Palindrome
+ * https://leetcode.com/problems/shortest-palindrome/
+ * Difficulty: Hard
+ *
+ * You are given a string s. You can convert s to a palindrome by adding characters
+ * in front of it.
+ *
+ * Return the shortest palindrome you can find by performing this transformation.
+ */
+
+/**
+ * @param {string} s
+ * @return {string}
+ */
+var shortestPalindrome = function(s) {
+  const reversed = s.split('').reverse().join('');
+  for (let i = s.length; i > 0; i--) {
+    if (s.slice(0, i) === reversed.slice(s.length - i)) {
+      return reversed.slice(0, reversed.length - i) + s;
+    }
+  }
+  return '';
+};