diff --git a/README.md b/README.md index 443446f16e..57be9fabc4 100644 --- a/README.md +++ b/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 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 &nums, vector 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, int k) { + vector visited(nums.size(),false); + int sum=0; + for(int i=0;i pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.

Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy