โ† Standard Chartered questions

Number of paths in a matrix from (0,0) to (n-1,m-1)

Filed under Standard Chartered

The question

Find the total number of valid paths from the top-left corner (0, 0) to the bottom-right corner (n - 1, m - 1) of a grid using dynamic programming.

No write-up yet. Related questions below have one.

Related Standard Chartered questions

Collected from public candidate posts and coding forums. Updated Nov 2026.