Add solution #1324

Author: JoshCrozier

README.md

@@ -50,6 +50,7 @@
 1313|[Decompress Run-Length Encoded List](./1313-decompress-run-length-encoded-list.js)|Easy|
 1317|[Convert Integer to the Sum of Two No-Zero Integers](./1317-convert-integer-to-the-sum-of-two-no-zero-integers.js)|Easy|
 1318|[Minimum Flips to Make a OR b Equal to c](./1318-minimum-flips-to-make-a-or-b-equal-to-c.js)|Medium|
+1324|[Print Words Vertically](./1324-print-words-vertically.js)|Medium|
 
 ## License
 

solutions/1324-print-words-vertically.js

@@ -0,0 +1,25 @@
+/**
+ * 1324. Print Words Vertically
+ * https://leetcode.com/problems/print-words-vertically/
+ * Difficulty: Medium
+ *
+ * Given a string s. Return all the words vertically in the same
+ * order in which they appear in s.
+ * Words are returned as a list of strings, complete with spaces
+ * when is necessary. (Trailing spaces are not allowed).
+ * Each word would be put on only one column and that in one
+ * column there will be only one word.
+ */
+
+/**
+ * @param {string} s
+ * @return {string[]}
+ */
+var printVertically = function(s) {
+  const result = [];
+  s.split(/\s+/).forEach((word, i) => word.split('').forEach((letter, j) => {
+    result[j] = result[j] || '';
+    result[j] += letter.padStart(i - result[j].length + 1, ' ');
+  }));
+  return result;
+};