151. Reverse Words in a String

Author: Tushar Borole

.idea/workspace.xml

@@ -70,6 +70,7 @@
 | 46   | [Permutations](https://leetcode.com/problems/permutations/)                                                                       | [permutations.js](permutations.js)                                                                            | 88 ms            | 37.6 MB              | Medium     |
 | 80   | [Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/)                   | [remove_duplicates_from_sorted_array_II.js](remove_duplicates_from_sorted_array_II.js)                        | 64 ms            | 35.8 MB              | Medium     |
 | 78   | [Subsets](https://leetcode.com/problems/subsets/)                                                                                 | [subset.js](subset.js)                                                                                        | 60 ms            | 35 MB                | Medium     |
+| 151  | [Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/)                                             | [reverse_words_in_string.js](reverse_words_in_string.js)                                                      | 56 ms            | 34.6 MB              | Medium     |
 
 
 ## Others

README.md

@@ -0,0 +1,49 @@
+// Given an input string, reverse the string word by word.
+//
+//
+//
+//     Example 1:
+//
+// Input: "the sky is blue"
+// Output: "blue is sky the"
+// Example 2:
+//
+// Input: "  hello world!  "
+// Output: "world! hello"
+// Explanation: Your reversed string should not contain leading or trailing spaces.
+//     Example 3:
+//
+// Input: "a good   example"
+// Output: "example good a"
+// Explanation: You need to reduce multiple spaces between two words to a single space in the reversed string.
+//
+//
+//     Note:
+//
+// A word is defined as a sequence of non-space characters.
+//     Input string may contain leading or trailing spaces. However, your reversed string should not contain leading or trailing spaces.
+//     You need to reduce multiple spaces between two words to a single space in the reversed string.
+//
+//
+//     Follow up:
+//
+//     For C programmers, try to solve it in-place in O(1) extra space.
+
+/**
+ * @param {string} s
+ * @return {string}
+ */
+var reverseWords = function(s) {
+  let stringArray = s
+    .trim()
+    .split(" ")
+    .filter(a => a.length > 0);
+  let out = "";
+  for (let i = stringArray.length - 1; i >= 0; i--) {
+    out += stringArray[i] + (i >= 1 ? " " : "");
+  }
+
+  return out;
+};
+
+reverseWords("a good   example"); //?