Algorithm Designda66_f1_map_walk
Map Walk
96c344fd-af1f-4917-a583-bf4cc9544379.cppC++
1// Loading code...Selected Submission
100 / 100
0.047s
1480 KB
BacktrackImplementation
Time Comp.
O(3^(m+n))
Space Comp.
O(m+n)
Readability
5/10
"The code uses a recursive function `walk` to explore possible paths in a grid, backtracking when a path doesn't lead to the destination. This is a classic application of backtracking to find a solution by trying different options and undoing choices if they don't work."
History
| Attempt | Points | Time ↓ |
|---|---|---|
| Try #17 | 100 | 1/31/2025 |
| Try #16 | 100 | 1/31/2025 |
| Try #15 | 100 | 1/31/2025 |
| Try #14 | 100 | 1/31/2025 |
| Try #13 | 100 | 1/31/2025 |
| Try #12 | 0 | 1/31/2025 |
| Try #11 | 0 | 1/31/2025 |
| Try #10 | 5 | 1/31/2025 |
| Try #9 | 100 | 1/31/2025 |
| Try #8 | 100 | 1/31/2025 |
| Try #7 | 55 | 1/31/2025 |
| Try #6 | 100 | 1/31/2025 |
| Try #5 | 0 | 1/31/2025 |
| Try #4 | 100 | 1/31/2025 |
| Try #3 | 100 | 1/31/2025 |
| Try #2 | 100 | 1/31/2025 |
| Try #1 | 100 | 1/31/2025 |