Add solution #3452

Author: JoshCrozier

README.md

@@ -626,6 +626,7 @@
 3396|[Minimum Number of Operations to Make Elements in Array Distinct](./3396-minimum-number-of-operations-to-make-elements-in-array-distinct.js)|Easy|
 3397|[Maximum Number of Distinct Elements After Operations](./3397-maximum-number-of-distinct-elements-after-operations.js)|Medium|
 3402|[Minimum Operations to Make Columns Strictly Increasing](./3402-minimum-operations-to-make-columns-strictly-increasing.js)|Easy|
+3452|[Sum of Good Numbers](./3452-sum-of-good-numbers.js)|Easy|
 
 ## License
 

solutions/3452-sum-of-good-numbers.js

@@ -0,0 +1,22 @@
+/**
+ * 3452. Sum of Good Numbers
+ * https://leetcode.com/problems/sum-of-good-numbers/
+ * Difficulty: Easy
+ *
+ * Given an array of integers nums and an integer k, an element nums[i] is considered good if
+ * it is strictly greater than the elements at indices i - k and i + k (if those indices exist).
+ * If neither of these indices exists, nums[i] is still considered good.
+ *
+ * Return the sum of all the good elements in the array.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number}
+ */
+var sumOfGoodNumbers = function(nums, k) {
+  return nums.reduce((sum, n, i) => {
+    return n > (nums[i - k] ?? 0) && n > (nums[i + k] ?? 0) ? sum + n : sum;
+  }, 0);
+};