Create 1262. Greatest Sum Divisible by Three1 (#940)

Author: Chayandas07

1262. Greatest Sum Divisible by Three1

@@ -0,0 +1,34 @@
+class Solution {
+public:
+    int maxSumDivThree(vector<int>& nums) {
+        int sum = 0;
+        vector<int> r1, r2;
+        
+        for(int x : nums){
+            sum += x;
+            if(x % 3 == 1) r1.push_back(x);
+            else if(x % 3 == 2) r2.push_back(x);
+        }
+        
+        if(sum % 3 == 0) return sum;
+        
+        sort(r1.begin(), r1.end());
+        sort(r2.begin(), r2.end());
+        
+        int rem = sum % 3;
+        int ans = 0;
+        
+        if(rem == 1){
+            int op1 = (r1.size() >= 1 ? sum - r1[0] : 0);
+            int op2 = (r2.size() >= 2 ? sum - r2[0] - r2[1] : 0);
+            ans = max(op1, op2);
+        }
+        else{ 
+            int op1 = (r2.size() >= 1 ? sum - r2[0] : 0);
+            int op2 = (r1.size() >= 2 ? sum - r1[0] - r1[1] : 0);
+            ans = max(op1, op2);
+        }
+        
+        return ans;
+    }
+};