easy5 pts · first answer countsdynamic-programminggrid-dpcounting
Paths across a 3 × 7 grid
A robot starts at the top-left of a grid with 3 rows and 7 columns and can only move right or down. How many different paths reach the bottom-right cell?
Discussion 0
Join free to post in the discussion.
Related questions
- Signs that a problem suits DPBackend Developer
- What memoisation meansBackend Developer
- What tabulation meansBackend Developer
- Cost of plain recursive FibonacciBackend Developer
- Fibonacci after adding a cacheBackend Developer
- Recursion with no base caseBackend Developer
- Ways to climb five stairsBackend Developer
- Hidden memory cost of recursionBackend Developer