Unique Paths: coding question

Problem

A robot stands in the top-left cell of a grid with m rows and n columns. The robot must reach the bottom-right cell.

In each move, the robot goes one cell down or one cell right. Return the number of different paths from the top-left cell to the bottom-right cell.

Input:: m = 3, n = 3
Output:: 6
Explanation:: Each path has 2 moves down and 2 moves right. These 4 moves can come in 6 different orders.

SysRound wrote this statement. A reference solution checks every example.

Continue with questions that share topics or the same question type.

Sources · 1 reference

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 4 records

Problem

A robot stands in the top-left cell of a grid with m rows and n columns. The robot must reach the bottom-right cell.

In each move, the robot goes one cell down or one cell right. Return the number of different paths from the top-left cell to the bottom-right cell.

Input:: m = 3, n = 3
Output:: 6
Explanation:: Each path has 2 moves down and 2 moves right. These 4 moves can come in 6 different orders.

SysRound wrote this statement. A reference solution checks every example.