From 4d88a9fd2d5b16318b8775ff645bfd2216e89df5 Mon Sep 17 00:00:00 2001 From: Anshul Gupta Date: Sat, 4 Jul 2020 08:05:26 +0530 Subject: [PATCH 1/6] Create _698.cpp --- cpp/_698.cpp | 37 +++++++++++++++++++++++++++++++++++++ 1 file changed, 37 insertions(+) create mode 100644 cpp/_698.cpp 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 Date: Sat, 4 Jul 2020 08:08:15 +0530 Subject: [PATCH 2/6] refactor 698 --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) 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 From 999a1b8bcd9f0771aef0321f437d9055bd355fb0 Mon Sep 17 00:00:00 2001 From: Anshul Gupta Date: Sun, 5 Jul 2020 22:31:30 +0530 Subject: [PATCH 3/6] Create _1431.cpp --- cpp/_1431.cpp | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) create mode 100644 cpp/_1431.cpp 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 kidsWithCandies(vector& candies, int extraCandies) { + + vector v; + int mx=0; + + for(int i=0;i Date: Sun, 5 Jul 2020 22:32:20 +0530 Subject: [PATCH 4/6] Create _1470.cpp --- cpp/_1470.cpp | 16 ++++++++++++++++ 1 file changed, 16 insertions(+) create mode 100644 cpp/_1470.cpp 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 shuffle(vector& nums, int n) { + + vector v; + + for(int i=0;i Date: Sun, 5 Jul 2020 22:33:03 +0530 Subject: [PATCH 5/6] Create _1480.cpp --- cpp/_1480.cpp | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 cpp/_1480.cpp 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 runningSum(vector& nums) { + + for(int i=1;i Date: Sun, 5 Jul 2020 22:36:24 +0530 Subject: [PATCH 6/6] refactor c++ solutions -added 1431,1470,1480 solutions --- README.md | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/README.md b/README.md index 57be9fabc4..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|