diff --git a/README.md b/README.md
index 443446f16e..988455d60c 100644
--- a/README.md
+++ b/README.md
@@ -15,11 +15,11 @@ _If you like this project, please leave me a star._ ★
 |1487|[Making File Names Unique](https://leetcode.com/problems/making-file-names-unique/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1487.java) | |Medium|HashTable, String|
 |1486|[XOR Operation in an Array](https://leetcode.com/problems/xor-operation-in-an-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1486.java) | |Medium|Array, Bit Manipulation|
 |1481|[Least Number of Unique Integers after K Removals](https://leetcode.com/problems/least-number-of-unique-integers-after-k-removals/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1481.java) | |Medium|Array, Sort|
-|1480|[Running Sum of 1d Array](https://leetcode.com/problems/running-sum-of-1d-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1480.java) | |Easy|Array|
+|1480|[Running Sum of 1d Array](https://leetcode.com/problems/running-sum-of-1d-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1480.java), [C++](../master/cpp/_1480.cpp)| |Easy|Array|
 |1476|[Subrectangle Queries](https://leetcode.com/problems/subrectangle-queries/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1476.java) | |Medium|Array|
 |1475|[Final Prices With a Special Discount in a Shop](https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1475.java) | |Easy|Array|
 |1471|[The k Strongest Values in an Array](https://leetcode.com/problems/the-k-strongest-values-in-an-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1471.java) | |Medium|Array, Sort|
-|1470|[Shuffle the Array](https://leetcode.com/problems/shuffle-the-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1470.java) | |Easy|Array|
+|1470|[Shuffle the Array](https://leetcode.com/problems/shuffle-the-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1470.java), [C++](../master/cpp/_1470.cpp) | |Easy|Array|
 |1466|[Reorder Routes to Make All Paths Lead to the City Zero](https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1466.java) | |Medium|Tree, DFS|
 |1464|[Maximum Product of Two Elements in an Array](https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1464.java) | |Easy|Array|
 |1460|[Make Two Arrays Equal by Reversing Sub-arrays](https://leetcode.com/problems/make-two-arrays-equal-by-reversing-sub-arrays/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1460.java) | |Easy|Array|
@@ -36,7 +36,7 @@ _If you like this project, please leave me a star._ ★
 |1437|[Check If All 1's Are at Least Length K Places Away](https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1437.java) | |Medium|Array|
 |1436|[Destination City](https://leetcode.com/problems/destination-city/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1436.java) | |Easy|String|
 |1432|[Max Difference You Can Get From Changing an Integer](https://leetcode.com/problems/max-difference-you-can-get-from-changing-an-integer/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1432.java) | |Medium|String|
-|1431|[Kids With the Greatest Number of Candies](https://leetcode.com/problems/kids-with-the-greatest-number-of-candies/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1431.java) | |Easy|Array|
+|1431|[Kids With the Greatest Number of Candies](https://leetcode.com/problems/kids-with-the-greatest-number-of-candies/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1431.java), [C++](../master/cpp/_1431.cpp) | |Easy|Array|
 |1428|[Leftmost Column with at Least a One](https://leetcode.com/problems/leftmost-column-with-at-least-a-one/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1428.java) | |Medium|Array|
 |1427|[Perform String Shifts](https://leetcode.com/problems/perform-string-shifts/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1427.java) | |Easy|Array, Math|
 |1426|[Counting Elements](https://leetcode.com/problems/counting-elements/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1426.java) | |Easy|Array|
@@ -350,7 +350,7 @@ _If you like this project, please leave me a star._ ★
 |701|[Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_701.java) |  |Medium | DFS, recursion
 |700|[Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_700.java) | |Easy| recusion, dfs
 |699|[Falling Squares](https://leetcode.com/problems/falling-squares/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_699.java) ||Hard | Segment Tree
-|698|[Partition to K Equal Sum Subsets](https://leetcode.com/problems/partition-to-k-equal-sum-subsets/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_698.java) |  |Medium | Backtracking
+|698|[Partition to K Equal Sum Subsets](https://leetcode.com/problems/partition-to-k-equal-sum-subsets/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_698.java), [C++](../master/cpp/_698.cpp) |  |Medium | Backtracking + DP
 |697|[Degree of an Array](https://leetcode.com/problems/degree-of-an-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_697.java) ||Easy | 
 |696|[Count Binary Substrings](https://leetcode.com/problems/count-binary-substrings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_696.java) | |Easy | 
 |695|[Max Area of Island](https://leetcode.com/problems/max-area-of-island/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_695.java) |  |Easy | DFS
diff --git a/cpp/_1431.cpp b/cpp/_1431.cpp
new file mode 100644
index 0000000000..38e71d2da0
--- /dev/null
+++ b/cpp/_1431.cpp
@@ -0,0 +1,24 @@
+// Kids With the Greatest Number of Candies
+
+class Solution {
+public:
+    vector<bool> kidsWithCandies(vector<int>& candies, int extraCandies) {
+    
+        vector<bool> v;
+        int mx=0;
+        
+        for(int i=0;i<candies.size();i++){
+            mx = max(mx,candies[i]);
+        }
+        
+        for(int i=0;i<candies.size();i++){
+            if(candies[i]+extraCandies<mx){
+                v.push_back(false);
+            }else{
+                v.push_back(true);
+            }
+        }
+        
+        return v;
+    }
+};
diff --git a/cpp/_1470.cpp b/cpp/_1470.cpp
new file mode 100644
index 0000000000..1f51997095
--- /dev/null
+++ b/cpp/_1470.cpp
@@ -0,0 +1,16 @@
+//Shuffle the Array
+
+class Solution {
+public:
+    vector<int> shuffle(vector<int>& nums, int n) {
+    
+        vector<int> v;
+         
+        for(int i=0;i<n;i++){
+            v.push_back(nums[i]);
+            v.push_back(nums[n+i]);
+        }
+        
+        return v;
+    }
+};
diff --git a/cpp/_1480.cpp b/cpp/_1480.cpp
new file mode 100644
index 0000000000..1c65d4b0c1
--- /dev/null
+++ b/cpp/_1480.cpp
@@ -0,0 +1,13 @@
+//Running Sum of 1d Array
+
+class Solution {
+public:
+    vector<int> runningSum(vector<int>& nums) {
+    
+        for(int i=1;i<nums.size();i++){
+            nums[i] += nums[i-1];
+        }
+        
+        return nums;
+    }
+};
diff --git a/cpp/_698.cpp b/cpp/_698.cpp
new file mode 100644
index 0000000000..5546927176
--- /dev/null
+++ b/cpp/_698.cpp
@@ -0,0 +1,37 @@
+//Partition to K Equal Sum Subsets
+
+class Solution {
+public:
+    
+    bool dfs(vector<int> &nums, vector<int> visited, int idx,int k,int currSum,int targetSum){
+        if(k==1){
+            //All subsets are found
+            return true;
+        }
+        if(currSum==targetSum){
+            //one subset found
+            return dfs(nums,visited,0,k-1,0,targetSum);
+        }
+        for(int i=idx;i<nums.size();i++){
+            if(!visited[i]){
+                visited[i]=true;
+                if(dfs(nums,visited,i+1,k,currSum+nums[i],targetSum)){
+                    return true;
+                }
+                visited[i]=false;
+            }
+        }
+        return false;
+    }
+    bool canPartitionKSubsets(vector<int>& nums, int k) {
+        vector<int> visited(nums.size(),false);
+        int sum=0;
+        for(int i=0;i<nums.size();i++){
+            sum += nums[i];
+        }
+        if(sum%k!=0){
+            return false;
+        }
+        return dfs(nums,visited,0,k,0,sum/k);
+    }
+};