Add path sum2 problem

Author: InclinedScorpio

leetcode/medium/tree/path_sum_2.cpp

@@ -0,0 +1,30 @@
+// https://leetcode.com/problems/path-sum-ii/
+
+/**
+ * LOGIC: Basic tree problem... just know pass by reference
+ *
+ */
+class Solution {
+public:
+    void helper(TreeNode* root, int targetSum, vector<int> nodes, vector<vector<int>>& result) {
+        if(!root) return;
+        if(!root->left && !root->right) {
+            if(targetSum - root->val==0) {
+                nodes.push_back(root->val);
+                result.push_back(nodes);   
+            }
+            return;
+        }
+        
+        nodes.push_back(root->val);
+        helper(root->left, targetSum - root->val, nodes, result);
+        helper(root->right, targetSum - root->val, nodes, result);
+    }
+    
+    vector<vector<int>> pathSum(TreeNode* root, int targetSum) {
+        vector<vector<int>> result;
+        helper(root, targetSum, {}, result);
+        return result;
+    }
+};
+

random_platform/misc/disjoint_sets/⭐️ rank_and_compression_algorithm_disjoint_set.cpp

@@ -13,10 +13,6 @@
  * - While doing find, if we see there are more steps to reach parent from a node, we do compression
  * - Compression will just make sure that all child nodes directly point to parent rather than forming chain
  * 
- * 
- * 
- * 
- * 
  */ 
 
 #include<iostream>