| # | User | Rating |
|---|---|---|
| 1 | ecnerwala | 3648 |
| 2 | Benq | 3580 |
| 3 | orzdevinwang | 3570 |
| 4 | cnnfls_csy | 3569 |
| 5 | Geothermal | 3568 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3530 |
| 8 | Radewoosh | 3520 |
| 9 | Um_nik | 3481 |
| 10 | jiangly | 3467 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 2 | adamant | 164 |
| 4 | TheScrasse | 159 |
| 4 | nor | 159 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 150 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
Help me In this question : Find number of paths from source to destination?
Hi. I recently came accross this question. Link
Given a 2d array where 1 represent a stone and 0 represent water. Return how many path exist in the matrix from top row to the bottom row. You can travel in all directions (top, bottom, left, right) by one position.
Input: [[0, 1, 0, 1, 1],
[0, 1, 1, 0, 1],
[0, 0, 1, 1, 0],
[0, 0, 0, 1, 1]]
The first obvious thought that comes to my mind is backtracking, but that will have large time complexity. How to do this optimally?
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en3 |
|
EmilyBloom | 2022-06-25 09:22:31 | 10 | Tiny change: 'to do this?\n\n' -> 'to do this optimally?\n\n' | |
| en2 |
|
EmilyBloom | 2022-06-25 09:22:15 | 6 | ||
| en1 |
|
EmilyBloom | 2022-06-25 09:21:53 | 661 | Initial revision (published) |
