count-paths-for-a-sum-medium__pattern-tree-depth-first-search__grokking-the-coding-interview-patterns-for-coding-questions
| Topic | Replies | Views | Activity | |
|---|---|---|---|---|
| Anther approach could be to use sliding window for path sum |
|
2 | 269 | July 18, 2022 |
| Shouldn't the space complexity by O(N**2)? |
|
1 | 106 | March 7, 2022 |
| O(1) Memory with Same time |
|
5 | 153 | February 28, 2022 |
| Cleaner solution |
|
3 | 388 | December 24, 2021 |
| Why need this step:del currentPath[-1] |
|
2 | 360 | December 15, 2021 |
| Prefix sums pattern |
|
0 | 220 | December 9, 2021 |
| Can we not just only iterate at the leaf nodes? |
|
1 | 174 | September 22, 2021 |
| Straight forward Java implementation with O(n) space & time |
|
1 | 228 | September 10, 2021 |
| O(N) time & space solution |
|
1 | 131 | August 27, 2021 |
| O(N) solution, just one top down recursive call and O(N*log(N)) space |
|
0 | 128 | May 7, 2021 |
| Simpler code, without using currentPath |
|
1 | 234 | May 4, 2021 |
| A proposal for improving the time complexity |
|
2 | 422 | October 30, 2020 |
| Time complexity for best case (balanced binary tree) |
|
1 | 188 | September 23, 2020 |