Create 3068. Find the Maximum Sum of Node Values1 (#802)

Author: Chayandas07

3068. Find the Maximum Sum of Node Values1

@@ -0,0 +1,19 @@
+class Solution {
+public:
+    long long maximumValueSum(vector<int>& nums, int k, vector<vector<int>>& edges) {
+        long long ans = 0;
+        int minLoss = INT_MAX;
+        int canInc = 0;
+
+        for(int i = 0; i < nums.size(); i++){
+            if(nums[i] > (nums[i]^k)) ans += nums[i];
+            else {
+                ans += nums[i]^k;
+                canInc++;
+            }
+            minLoss = min(minLoss,abs(nums[i]-(nums[i]^k)));
+        }
+        if(canInc % 2 == 0) return ans;
+        return ans-minLoss;
+    }
+};