Paths in a Matrix Problem Statement

Given an 'M x N' matrix, print all the possible paths from the top-left corner to the bottom-right corner. You can only move either right (from (i,j) to (i,j+1)) or down (from (i,j) to (i+1,j)).

Example:

Input:

M = 2, N = 3
matrix = [[1, 2, 3], [4, 5, 6]]

Output:

(1 2 3 6)
(1 2 5 6)
(1 4 5 6)

Explanation:

For the given 2x3 matrix, possible paths are (1 2 3 6), (1 2 5 6), and (1 4 5 6).

Constraints:

1

Question

Paths in a Matrix Problem Statement

Given an 'M x N' matrix, print all the possible paths from the top-left corner to the bottom-right corner. You can only move either right (from (i,j) to (i,j+1)) or down (from (i,j) to (i+1,j)).

Example:

Input:

M = 2, N = 3
matrix = [[1, 2, 3], [4, 5, 6]]

Output:

(1 2 3 6)
(1 2 5 6)
(1 4 5 6)

Explanation:

For the given 2x3 matrix, possible paths are (1 2 3 6), (1 2 5 6), and (1 4 5 6).

Constraints:

1 <= M, N <= 10
Time Limit: 1 sec

Note:

You can return the paths in any order. You do not need to print anything; it's already handled. Implement the function to accomplish this task.

Accepted Answer

Print all possible paths from top-left to bottom-right in a matrix by moving only right or down.

Use backtracking to explore all possible paths from top-left to bottom-right in the matrix.
At each cell, recursively explore moving right and down until reaching the bottom-right corner.
Keep track of the current path and add it to the result when reaching the destination.