Add solution #2109

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,752 LeetCode solutions in JavaScript
+# 1,753 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1615,6 +1615,7 @@
 2105|[Watering Plants II](./solutions/2105-watering-plants-ii.js)|Medium|
 2106|[Maximum Fruits Harvested After at Most K Steps](./solutions/2106-maximum-fruits-harvested-after-at-most-k-steps.js)|Hard|
 2108|[Find First Palindromic String in the Array](./solutions/2108-find-first-palindromic-string-in-the-array.js)|Easy|
+2109|[Adding Spaces to a String](./solutions/2109-adding-spaces-to-a-string.js)|Medium|
 2114|[Maximum Number of Words Found in Sentences](./solutions/2114-maximum-number-of-words-found-in-sentences.js)|Easy|
 2115|[Find All Possible Recipes from Given Supplies](./solutions/2115-find-all-possible-recipes-from-given-supplies.js)|Medium|
 2116|[Check if a Parentheses String Can Be Valid](./solutions/2116-check-if-a-parentheses-string-can-be-valid.js)|Medium|

solutions/2109-adding-spaces-to-a-string.js

@@ -0,0 +1,33 @@
+/**
+ * 2109. Adding Spaces to a String
+ * https://leetcode.com/problems/adding-spaces-to-a-string/
+ * Difficulty: Medium
+ *
+ * You are given a 0-indexed string s and a 0-indexed integer array spaces that describes the
+ * indices in the original string where spaces will be added. Each space should be inserted
+ * before the character at the given index.
+ * - For example, given s = "EnjoyYourCoffee" and spaces = [5, 9], we place spaces before 'Y'
+ *   and 'C', which are at indices 5 and 9 respectively. Thus, we obtain "Enjoy Your Coffee".
+ *
+ * Return the modified string after the spaces have been added.
+ */
+
+/**
+ * @param {string} s
+ * @param {number[]} spaces
+ * @return {string}
+ */
+var addSpaces = function(s, spaces) {
+  let result = '';
+  let spaceIndex = 0;
+
+  for (let i = 0; i < s.length; i++) {
+    if (spaceIndex < spaces.length && i === spaces[spaceIndex]) {
+      result += ' ';
+      spaceIndex++;
+    }
+    result += s[i];
+  }
+
+  return result;
+};