Add solution #917

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,400 LeetCode solutions in JavaScript
+# 1,401 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -733,6 +733,7 @@
 914|[X of a Kind in a Deck of Cards](./solutions/0914-x-of-a-kind-in-a-deck-of-cards.js)|Medium|
 915|[Partition Array into Disjoint Intervals](./solutions/0915-partition-array-into-disjoint-intervals.js)|Medium|
 916|[Word Subsets](./solutions/0916-word-subsets.js)|Medium|
+917|[Reverse Only Letters](./solutions/0917-reverse-only-letters.js)|Easy|
 918|[Maximum Sum Circular Subarray](./solutions/0918-maximum-sum-circular-subarray.js)|Medium|
 919|[Complete Binary Tree Inserter](./solutions/0919-complete-binary-tree-inserter.js)|Medium|
 920|[Number of Music Playlists](./solutions/0920-number-of-music-playlists.js)|Hard|

solutions/0917-reverse-only-letters.js

@@ -0,0 +1,35 @@
+/**
+ * 917. Reverse Only Letters
+ * https://leetcode.com/problems/reverse-only-letters/
+ * Difficulty: Easy
+ *
+ * Given a string s, reverse the string according to the following rules:
+ * - All the characters that are not English letters remain in the same position.
+ * - All the English letters (lowercase or uppercase) should be reversed.
+ *
+ * Return s after reversing it.
+ */
+
+/**
+ * @param {string} s
+ * @return {string}
+ */
+var reverseOnlyLetters = function(s) {
+  const chars = s.split('');
+  let left = 0;
+  let right = s.length - 1;
+
+  while (left < right) {
+    while (left < right && !/[a-zA-Z]/.test(chars[left])) {
+      left++;
+    }
+    while (left < right && !/[a-zA-Z]/.test(chars[right])) {
+      right--;
+    }
+    [chars[left], chars[right]] = [chars[right], chars[left]];
+    left++;
+    right--;
+  }
+
+  return chars.join('');
+};