Add solution #418

Author: JoshCrozier

README.md

@@ -406,6 +406,7 @@
 415|[Add Strings](./solutions/0415-add-strings.js)|Easy|
 416|[Partition Equal Subset Sum](./solutions/0416-partition-equal-subset-sum.js)|Medium|
 417|[Pacific Atlantic Water Flow](./solutions/0417-pacific-atlantic-water-flow.js)|Medium|
+418|[Sentence Screen Fitting](./solutions/0418-sentence-screen-fitting.js)|Medium|
 419|[Battleships in a Board](./solutions/0419-battleships-in-a-board.js)|Medium|
 420|[Strong Password Checker](./solutions/0420-strong-password-checker.js)|Hard|
 421|[Maximum XOR of Two Numbers in an Array](./solutions/0421-maximum-xor-of-two-numbers-in-an-array.js)|Medium|

solutions/0418-sentence-screen-fitting.js

@@ -0,0 +1,42 @@
+/**
+ * 418. Sentence Screen Fitting
+ * https://leetcode.com/problems/sentence-screen-fitting/
+ * Difficulty: Medium
+ *
+ * Given a rows x cols screen and a sentence represented as a list of strings, return the number
+ * of times the given sentence can be fitted on the screen.
+ *
+ * The order of words in the sentence must remain unchanged, and a word cannot be split into two
+ * lines. A single space must separate two consecutive words in a line.
+ */
+
+/**
+ * @param {string[]} sentence
+ * @param {number} rows
+ * @param {number} cols
+ * @return {number}
+ */
+var wordsTyping = function(sentence, rows, cols) {
+  const sentenceLength = sentence.length;
+  const wordLengths = sentence.map(word => word.length + 1);
+  let rowIndex = 0;
+  let colIndex = 0;
+  let wordIndex = 0;
+  let result = 0;
+
+  while (rowIndex < rows) {
+    if (colIndex + wordLengths[wordIndex] - 1 <= cols) {
+      colIndex += wordLengths[wordIndex];
+      wordIndex++;
+      if (wordIndex === sentenceLength) {
+        result++;
+        wordIndex = 0;
+      }
+    } else {
+      rowIndex++;
+      colIndex = 0;
+    }
+  }
+
+  return result;
+};