# Print all paths from top left to bottom right of MxN matrix

If you want to practice data structure and algorithm programs, you can go through Java coding interview questions.

In this post, we will see how to print all paths from top left to bottom right of MxN matrix.

## Problem

We need to print all paths from top left to bottom right of MxN matrix. You can either move down or right.

💻 Awesome Tech Resources:
• Looking for ⚒️ tech jobs? Go to our job portal.
• Looking for tech events? Go to tech events 🗓️ Calendar.️

## Solution

You can solve this problem using recursion.

### Recursion

• We will pass row and column to track current row and column.
• paths will contain elements which we are going to print.
• Add current element to the path
• Go down by updating row to row+1
• matrixPathHelper(list, paths, matrix,row+1,column);
• Go right by updating column to column+1
• matrixPathHelper(list, paths, matrix,row,column+1);
• Once we are done, backtrack by removing last element from the list.
• paths.remove(paths.size() – 1);
• Base case 1:
• Once we reach to last row, we can only go right, so iterate from column to matrix[0].length and add elements to paths.
• Base case 2:
• Once we reach to last column, we can only go down, so iterate from row to matrix.length and add elements to paths.

Here is complete java program to print all paths from top left to bottom right of MxN matrix.

Output

Paths:
[1, 4, 7, 8, 9] [1, 4, 5, 8, 9] [1, 4, 5, 6, 9] [1, 2, 5, 8, 9] [1, 2, 5, 6, 9] [1, 2, 3, 6, 9]

Here is diagram to illustrate recursion.

Please open above image in a new tab.

That’s all about how to print all paths from top left to bottom right of MxN matrix

## Related Posts

• 16 April

### Data Structures in java

In this post, we will see about various data structures in java. Data structure is a way of storing and organizing data. Data structure provide a way to process and store data efficiently. For example: 💻 Awesome Tech Resources: Looking for ⚒️ tech jobs? Go to our job portal. Looking for tech events? Go to […]

• 29 November

### Top 100+ Java coding interview questions

I have been posting data structure and coding interview questions on various topics such as Array, Queue, Stack, Binary tree, LinkedList, String, Number, ArrayList, etc. So I am consolidating a list of java coding interview questions to create an index post. I will keep adding links to this post whenever I will add new java […]

• 18 April

### Minimum Number of Jumps to reach last Index

If you want to practice data structure and algorithm programs, you can go through Java coding interview questions. In this post, we will see how to find Minimum Number of Jumps to reach last Index. Problem Given an array A of positive integers possibly zeroes, every index indicating the maximum length of a jump that can […]

• 28 March

### Sort an array of 0s, 1s and 2s

If you want to practice data structure and algorithm programs, you can go through Java coding interview questions. In this post, we will see how to sort an array of 0s, 1s and 2s.We have already seen a post on sort 0s and 1s in an array. Problem Given an array containing zeroes, ones and twos […]

• 04 March

### Check if it is possible to reach end of given Array by Jumping

If you want to practice data structure and algorithm programs, you can go through Java coding interview questions. ﻿ ﻿ Problem Given an array with positive integers as elements indicating the maximum length of a jump which can be made from any position in the array. Check if it is possible to have a jumps combination […]

• 17 February

### Check if Array Elements are Consecutive

If you want to practice data structure and algorithm programs, you can go through 100+ data structure and algorithm programs. In this post, we will see how to check if array elements are consecutive. Problem Given an array, we need to check if array contains consecutive elements. For example: Input: array[] = {5, 3, 4, […]

## Subscribe to our newletter

Get quality tutorials to your inbox. Subscribe now.