minimum-jumps-to-reach-the-end__pattern-3-fibonacci-numbers__grokking-dynamic-programming-patterns-for-coding-interviews
| Topic | Replies | Views | Activity | |
|---|---|---|---|---|
| Adding we add a 1 to currentIndex |
|
1 | 70 | October 18, 2022 |
| Adding the CurrentIndex along with the jumps[CurrentIndex] |
|
5 | 70 | September 6, 2022 |
| Java O(N) time O(1) space solution |
|
1 | 174 | April 24, 2022 |
| Correct time complexity of recursive solution should be O(x^n) where x is largest element in array and n is total number of elements |
|
1 | 80 | April 11, 2022 |
| What's the correct time complexity for minimum jumps to reach the end of an array? |
|
2 | 118 | December 1, 2021 |
| Better bottom-up solution (O(n) time complexity) |
|
1 | 174 | September 6, 2021 |
| The time complexity of the basic solution should be exponential ie O(2^n) |
|
6 | 451 | June 2, 2021 |
| Topdown Solution Missing Space + Time Complexity? |
|
0 | 147 | December 12, 2020 |
| Bottom-up solution - why do we compare dp[end] itself with dp[start]+1? |
|
1 | 219 | October 14, 2020 |