ByteByteGo logo
menuProblems List

Matrix Pathways

Medium

You are positioned at the top-left corner of a m × n matrix, and can only move downward or rightward through the matrix. Determine the number of unique pathways you can take to reach the bottom-right corner of the matrix.

Example:

Input: m = 3, n = 3
Output: 6

Constraints:

  • m, n ≥ 1

You can practice coding exercises online by logging into bytebytego.com on your laptop.