Redirecting to
NADOS

Cherry Pickup

  Prev   Next

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

1. You are given a number N, which represents the rows and columns of a 2-D matrix.
2. Matrix contains only three values - 
   a. Cell is empty.
   b. Cell contains a cherry.
   c. Cell contains a thorn and you can not pass through this cell.
3. You have to find the maximum number of cherries that you can collect following these rules :
   a. You have to start from (0,0) and travel till (N-1,N-1) by moving right or down, 
    one step at a time.
   b. After reaching (N-1,N-1), you have to come back to (0,0) by moving left or up, 
    one step at a time.   

Note -> If there is no valid path between the top-left cell and bottom-right cell, then no cherries can be collected.
Input Format 
A number N
arr1
arr2... (N*N numbers).
Output Format 
Check the sample output and question video.
Question Video
Constraints 
1 <= N <= 50
Cells can have only three values 0,1 and -1.
Sample Input 
3
0 
1 
-1
1 
0
-1
1 
1  
1
Sample Output 
5


  • Asked in Companies
  • Related Topics






Video Solution

Code Solution

Run
 
Run
Id Name