Geeksforgeeks

Error

Given a grid of size n*n filled with 0, 1, 2, 3. Check whether there is a path possible from the source to destination. You can traverse up, down, right and left.

The description of cells is as follows:

- A value of cell
**1**means Source. - A value of cell
**2**means Destination. - A value of cell
**3**means Blank cell. - A value of cell
**0**means Wall.

**Note**: There are only a single source and a single destination.

**Example 1:**

**Input: **grid = {{3,0,3,0,0},{3,0,0,0,3}
,{3,3,3,3,3},{0,2,3,0,0},{3,0,0,1,3}}
**Output: **0
**Explanation: **The grid is-
3 0 3 0 0
3 0 0 0 3
3 3 3 3 3
0 2 3 0 0
3 0 0 1 3
There is no path to reach at (3,1) i,e at
destination from (4,3) i,e source.

**Example 2:**

**Input: **grid = {{1,3},{3,2}}
**Output: **1
**Explanation: **The grid is-
1 3
3 2
There is a path from (0,0) i,e source to (1,1)
i,e destination.

**Your Task:**

You don't need to read or print anything. Your task is to complete the function **is_Possible() **which takes the grid as input parameter and returns boolean value true if there is a path otherwise returns false.

**Expected Time Complexity: **O(n^{2})

**Expected Auxiliary Space: **O(n^{2})

**Constraints:**

1 ≤ n ≤ 500

We are replacing the old Disqus forum with the new Discussions section given below.

Click here to view old Disqus comments.

Click here to view old Disqus comments.

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

YesLoading...

Find whether path exist

...