Hello , suggest any problem (or set of problems) that can be solved using recursion and it's grid based , problems like go from s to e , or find the shortest path .... etc
Hello , suggest any problem (or set of problems) that can be solved using recursion and it's grid based , problems like go from s to e , or find the shortest path .... etc
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | jiangly | 3631 |
| 4 | Kevin114514 | 3574 |
| 5 | maroonrk | 3521 |
| 6 | strapple | 3515 |
| 7 | Radewoosh | 3461 |
| 8 | tourist | 3428 |
| 9 | turmax | 3378 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 140 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
| Name |
|---|



https://mirror.codeforces.com/contest/1811/problem/D
If you are looking for a standard problem set I recommend looking at Graph Algorithms inside CSES's problem set.
Here are some problems from that set that are grid based:
contest dp atcoder, https://atcoder.jp/contests/dp
good luck!
CSES queens and chess