Add C++ implementation

Signed-off-by: begeekmyfriend <begeekmyfriend@gmail.com>

Author: begeekmyfriend

072_edit_distance/edit_distance.cc

@@ -23,7 +23,7 @@ class Solution {
                  }
             }
         }
-        
+
         return dp[word1.length()][word2.length()];
     }
 };

1373_maximum_sum_bst_in_binary_tree/max_bst.cc

@@ -41,6 +41,7 @@ class Solution {
         int sum = root->val + subl->sum_val + subr->sum_val;
         if (subl->isBst && subr->isBst && root->val > subl->max_val && root->val < subr->min_val) {
             max_sum = max(sum, max_sum);
+            // For leaf nodes
             int min_val = min(root->val, subl->min_val);
             int max_val = max(root->val, subr->max_val);
             return new TreeInfo(true, min_val, max_val, sum);

416_partition_equal_subset_sum/partition.cc

@@ -0,0 +1,28 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+class Solution {
+public:
+    bool canPartition(vector<int>& nums) {
+        int sum = 0;
+        for (int n : nums) {
+            sum += n;
+        }
+        if (sum % 2 != 0) {
+            return false;
+        }
+
+        vector<bool> dp(sum / 2 + 1, false);
+        dp[0] = true;
+        for (int i = 0; i < nums.size(); i++) {
+            for (int j = sum / 2 ; j >= 0; j--) {
+                if (j >= nums[i]) {
+                    dp[j] = dp[j] || dp[j - nums[i]];
+                }
+            }
+        }
+
+        return dp[sum / 2];
+    }
+};