unbounded-knapsack__pattern-2-unbounded-knapsack__grokking-dynamic-programming-patterns-for-coding-interviews
| Topic | Replies | Views | Activity | |
|---|---|---|---|---|
| Find Selected Elements in Top-Down Approach |
|
2 | 249 | July 29, 2022 |
| How brute-force solution has complexity O(2 ^(N+C) ) |
|
3 | 678 | January 18, 2021 |
| Shouldn't the space complexity be O( max(C,T)) instead of O( C+T) for recursive approach? |
|
0 | 151 | December 10, 2020 |
| What is wrong with the below approach? |
|
0 | 266 | March 11, 2020 |
| I can't tell the difference of the code between unbounded question and 0/1 knapback |
|
1 | 249 | April 18, 2020 |
| Why space complexity is O(2^n) in Basic Solution? |
|
1 | 226 | April 18, 2020 |