equal-subset-sum-partition__pattern-1-01-knapsack__grokking-dynamic-programming-patterns-for-coding-interviews
| Topic | Replies | Views | Activity | |
|---|---|---|---|---|
| Space complexity O(S) 1D array java solution |
|
0 | 79 | April 19, 2022 |
| Sorta feature request: update python code |
|
1 | 67 | February 12, 2022 |
| https://www.educative.io/courses/grokking-dynamic-programming-patterns-for-coding-interviews/3jEPRo5PDvx |
|
2 | 145 | January 16, 2022 |
| I am not able to edit code |
|
1 | 136 | October 6, 2021 |
| Wrong time and space complexities in Equal Subset problem |
|
0 | 103 | April 9, 2021 |
| Why does last row and columns being True means that the subset equals each other? |
|
0 | 105 | October 7, 2020 |
| Incorrect Test Case number 2 in equal subset problem |
|
0 | 126 | May 9, 2020 |
| The code provides here fails for the test case [1,2,5] expected is false but the code returns true |
|
1 | 284 | April 8, 2020 |
| Can we solve this problem too with Space complexity of O(n) like the Knapsack problem? |
|
1 | 187 | April 8, 2020 |
| In the dp solution, handling only one number soluton |
|
2 | 217 | July 23, 2019 |
| This fails with negative numbers. How to implement when -ve numbers exists |
|
1 | 229 | May 20, 2019 |