Add solution #2873

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,111 LeetCode solutions in JavaScript
+# 1,112 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1091,6 +1091,7 @@
 2727|[Is Object Empty](./solutions/2727-is-object-empty.js)|Easy|
 2780|[Minimum Index of a Valid Split](./solutions/2780-minimum-index-of-a-valid-split.js)|Medium|
 2818|[Apply Operations to Maximize Score](./solutions/2818-apply-operations-to-maximize-score.js)|Hard|
+2873|[Maximum Value of an Ordered Triplet I](./solutions/2873-maximum-value-of-an-ordered-triplet-i.js)|Easy|
 2948|[Make Lexicographically Smallest Array by Swapping Elements](./solutions/2948-make-lexicographically-smallest-array-by-swapping-elements.js)|Medium|
 2965|[Find Missing and Repeated Values](./solutions/2965-find-missing-and-repeated-values.js)|Easy|
 3042|[Count Prefix and Suffix Pairs I](./solutions/3042-count-prefix-and-suffix-pairs-i.js)|Easy|

solutions/2873-maximum-value-of-an-ordered-triplet-i.js

@@ -0,0 +1,32 @@
+/**
+ * 2873. Maximum Value of an Ordered Triplet I
+ * https://leetcode.com/problems/maximum-value-of-an-ordered-triplet-i/
+ * Difficulty: Easy
+ *
+ * You are given a 0-indexed integer array nums.
+ *
+ * Return the maximum value over all triplets of indices (i, j, k) such that i < j < k.
+ * If all such triplets have a negative value, return 0.
+ *
+ * The value of a triplet of indices (i, j, k) is equal to (nums[i] - nums[j]) * nums[k].
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var maximumTripletValue = function(nums) {
+  let result = 0;
+
+  for (let i = 0; i < nums.length - 2; i++) {
+    for (let j = i + 1; j < nums.length - 1; j++) {
+      const diff = nums[i] - nums[j];
+      if (diff <= 0) continue;
+      for (let k = j + 1; k < nums.length; k++) {
+        result = Math.max(result, diff * nums[k]);
+      }
+    }
+  }
+
+  return result;
+};