Problem 59526. Count paths between corners of a grid that remain on or below the diagonal
Consider motion from the lower left corner of a square grid to the upper right corner. The motion is constrained in two ways: (1) the only legal moves are (0,1), (1,0), and (1,1)—i.e., right, up, and up-and-right between points of the lattice—and (2) the motion must remain on or below the line connecting the starting and finishing corners. For a 2x2 grid, the number of paths is 6, as shown below.
Write a function to count the legal paths for an nxn grid. Return the count as a string. Check the last test for banned functions.
Solution Stats
Solution Comments
Show commentsProblem Recent Solvers3
Suggested Problems
-
Maintain shape of logical-index mask
69 Solvers
-
130 Solvers
-
Get the elements of diagonal and antidiagonal for any m-by-n matrix
470 Solvers
-
Find out missing number from a vector of 9 elements
290 Solvers
-
Given a matrix, swap the 2nd & 3rd columns
1015 Solvers
More from this Author250
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!