Add C++ Solution for 698 (fishercoder1534#79)

* Create _698.cpp

* refactor 698

Author: Anshul1507

README.md

@@ -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

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);
+    }
+};