Add solution #1262

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,201 LeetCode solutions in JavaScript
+# 1,202 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -960,6 +960,7 @@
 1255|[Maximum Score Words Formed by Letters](./solutions/1255-maximum-score-words-formed-by-letters.js)|Hard|
 1260|[Shift 2D Grid](./solutions/1260-shift-2d-grid.js)|Easy|
 1261|[Find Elements in a Contaminated Binary Tree](./solutions/1261-find-elements-in-a-contaminated-binary-tree.js)|Medium|
+1262|[Greatest Sum Divisible by Three](./solutions/1262-greatest-sum-divisible-by-three.js)|Medium|
 1267|[Count Servers that Communicate](./solutions/1267-count-servers-that-communicate.js)|Medium|
 1268|[Search Suggestions System](./solutions/1268-search-suggestions-system.js)|Medium|
 1287|[Element Appearing More Than 25% In Sorted Array](./solutions/1287-element-appearing-more-than-25-in-sorted-array.js)|Easy|

solutions/1262-greatest-sum-divisible-by-three.js

@@ -0,0 +1,25 @@
+/**
+ * 1262. Greatest Sum Divisible by Three
+ * https://leetcode.com/problems/greatest-sum-divisible-by-three/
+ * Difficulty: Medium
+ *
+ * Given an integer array nums, return the maximum possible sum of elements of the array such
+ * that it is divisible by three.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var maxSumDivThree = function(nums) {
+  const dp = [0, -Infinity, -Infinity];
+
+  for (const num of nums) {
+    const prev = [...dp];
+    for (let remainder = 0; remainder < 3; remainder++) {
+      dp[(remainder + num) % 3] = Math.max(dp[(remainder + num) % 3], prev[remainder] + num);
+    }
+  }
+
+  return dp[0];
+};