Add solution #1588

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,386 LeetCode solutions in JavaScript
+# 1,387 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1211,6 +1211,7 @@
 1583|[Count Unhappy Friends](./solutions/1583-count-unhappy-friends.js)|Medium|
 1584|[Min Cost to Connect All Points](./solutions/1584-min-cost-to-connect-all-points.js)|Medium|
 1585|[Check If String Is Transformable With Substring Sort Operations](./solutions/1585-check-if-string-is-transformable-with-substring-sort-operations.js)|Hard|
+1588|[Sum of All Odd Length Subarrays](./solutions/1588-sum-of-all-odd-length-subarrays.js)|Easy|
 1598|[Crawler Log Folder](./solutions/1598-crawler-log-folder.js)|Easy|
 1657|[Determine if Two Strings Are Close](./solutions/1657-determine-if-two-strings-are-close.js)|Medium|
 1668|[Maximum Repeating Substring](./solutions/1668-maximum-repeating-substring.js)|Easy|

solutions/1588-sum-of-all-odd-length-subarrays.js

@@ -0,0 +1,24 @@
+/**
+ * 1588. Sum of All Odd Length Subarrays
+ * https://leetcode.com/problems/sum-of-all-odd-length-subarrays/
+ * Difficulty: Easy
+ *
+ * Given an array of positive integers arr, return the sum of all possible odd-length
+ * subarrays of arr.
+ *
+ * A subarray is a contiguous subsequence of the array.
+ */
+
+/**
+ * @param {number[]} arr
+ * @return {number}
+ */
+var sumOddLengthSubarrays = function(arr) {
+  let result = 0;
+
+  for (let index = 0; index < arr.length; index++) {
+    result += arr[index] * Math.ceil(((index + 1) * (arr.length - index)) / 2);
+  }
+
+  return result;
+};