all-paths-for-a-sum-medium__pattern-tree-depth-first-search__grokking-the-coding-interview-patterns-for-coding-questions
| Topic | Replies | Views | Activity | |
|---|---|---|---|---|
| All-paths-for-a-sum- How's time complexity O(N^2) |
|
4 | 325 | March 22, 2022 |
| Is the Javascript answer correct |
|
4 | 248 | March 5, 2022 |
| Simpler solution with only one function, am I missing something? |
|
1 | 267 | March 5, 2022 |
| Why time complexity O(n^2)? |
|
3 | 212 | March 4, 2022 |
| Can't we simply use a stack to eliminate the time taken by 'remove'? |
|
1 | 139 | November 4, 2021 |
| Why is currentpath variable is type casted to list when it is already a list |
|
2 | 339 | March 24, 2021 |
| Isn't my algorithm O(N) time complexity for All Paths for a Sum? Compare to O(N lgN) of given solution (i.e. why backtracking is preferred, when we can solve in O(N)?) |
|
3 | 774 | March 6, 2021 |
| Simpler code for all paths for a sum |
|
1 | 217 | March 6, 2021 |
| Count can be done with O(n) without backtracking |
|
0 | 171 | February 28, 2021 |
| Space Complexity Clarification |
|
0 | 244 | January 24, 2021 |
| Incorrect statement in regards to all leaf nodes will be at maximum depth in a balanced tree |
|
0 | 159 | January 22, 2021 |