New update is available. Click here to update.
Close
Topic list
Rat In a Maze All Paths
MEDIUM
40 mins
203 upvotes
Matrices (2D Arrays)
Topics (Covered in this problem)
Problem solved
Badge
Skill meter
Matrices (2D Arrays)
-
-
Other topics
Problem solved
Badge
Skill meter
Strings
-
-
Linked List
-
-
Sorting
-
-
Binary Search
-
-
Stacks & Queues
-
-
Trees
-
-
Graph
-
-
Dynamic Programming
-
-
Greedy
-
-
Tries
-
-
Arrays
-
-
SQL
-
-
Binary Search Trees
-
-
Heap
-
-
Bit Manipulation
-
-
Solve problems & track your progress
Checkout your overall progress in every topic here
Become
Sensei
in DSA topics
Open the topic and solve more problems associated with it to improve your skills
Check out the skill meter for every topic
See how many problems you are left with to solve for cracking any stage. Score more than zero to get your progress counted.

# Rat In a Maze All Paths

Contributed by
Deep Mavani
Medium
0/80
Avg time to solve 40 mins
Success Rate 60 %
Share
203 upvotes

## Problem Statement

#### Value of every cell in the 'MAZE' can either be 0 or 1. Cells with value 0 are blocked means the rat can­not enter into those cells and those with value 1 are open.

Detailed explanation ( Input/output format, Notes, Constraints, Images )
##### Sample Input 1 :
``````3
1 0 1
1 0 1
1 1 1
``````
##### Sample Output 1 :
``````1 0 0 1 0 0 1 1 1
``````
##### Explanation for Sample Output 1:
``````Only 1 path is possible which contains coordinate < (1,1), (2,1), (3,1), (3,2) and (3,3) >

So our path matrix will look like this:

1 0 0
1 0 0
1 1 1

Which is returned from left to right and then top to bottom in one line.
``````
##### Sample Input 2 :
``````2
1 0
0 1
``````
##### Sample Output 2 :
`````` [Blank]
``````
##### Explanation for Sample Output 2:
``````As no path is possible to the last cell, a blank vector will be returned and nothing is printed.
``````
Auto
Console