Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding
Ninjas X Naukri.com

Problem of the day

You are present at point â€˜Aâ€™ which is the top-left cell of an M X N matrix, your destination is point â€˜Bâ€™, which is the bottom-right cell of the same matrix. Your task is to find the total number of unique paths from point â€˜Aâ€™ to point â€˜Bâ€™.In other words, you will be given the dimensions of the matrix as integers â€˜Mâ€™ and â€˜Nâ€™, your task is to find the total number of unique paths from the cell MATRIX[0][0] to MATRIX['M' - 1]['N' - 1].

To traverse in the matrix, you can either move Right or Down at each step. For example in a given point MATRIX[i] [j], you can move to either MATRIX[i + 1][j] or MATRIX[i][j + 1].

Detailed explanation

```
1 â‰¤ T â‰¤ 100
1 â‰¤ M â‰¤ 15
1 â‰¤ N â‰¤ 15
Where â€˜Mâ€™ is the number of rows and â€˜Nâ€™ is the number of columns in the matrix.
Time limit: 1 sec
```

```
2
2 2
1 1
```

```
2
1
```

```
In test case 1, we are given a 2 x 2 matrix, to move from matrix[0][0] to matrix[1][1] we have the following possible paths.
Path 1 = (0, 0) -> (0, 1) -> (1, 1)
Path 2 = (0, 0) -> (1, 0) -> (1, 1)
Hence a total of 2 paths are available, so the output is 2.
In test case 2, we are given a 1 x 1 matrix, hence we just have a single cell which is both the starting and ending point. Hence the output is 1.
```

```
2
3 2
1 6
```

```
3
1
```

```
In test case 1, we are given a 3 x 2 matrix, to move from matrix[0][0] to matrix[2][1] we have the following possible paths.
Path 1 = (0, 0) -> (0, 1) -> (1, 1) -> (2, 1)
Path 2 = (0, 0) -> (1, 0) -> (2, 0) -> (2, 1)
Path 3 = (0, 0) -> (1, 0) -> (1, 1) -> (2, 1)
Hence a total of 3 paths are available, so the output is 3.
In test case 2, we are given a 1 x 6 matrix, hence we just have a single row to traverse and thus total path will be 1.
```