MIN PATH SUM IN GIVEN BOUNDARIES.. WHY ERROR?
# please help me out , why this code is showing an error ????? 

# We are asked to start from (0,0) and reach to (2,2) , by exploring Horizantal and vertical directions  in all ways. 



def explore(grid,i,j,ed1,ed2,Row,Col,dp):
    if i< 0 or i>Row-1 or  j> Col-1 or j<0  :
        return 0
    if i==ed1 and j==ed2:
        return grid[i][j]
        
    left=explore(grid,i,j-1,ed1,ed2,Row,Col,dp)
    up=explore(grid,i-1,j,ed1,ed2,Row,Col,dp)
    down=explore(grid,i+1,j,ed1,ed2,Row,Col,dp)
    right=explore(grid,i,j+1,ed1,ed2,Row,Col,dp)

    
    dp[i][j] = grid[i][j]+ min(up,left,right,down)
    return dp

grid=[[1,1,2],[5,6,10],[1,2,1]]
Row=len(grid)
Col=len(grid[0])
dp=[[1000 for _ in range(Row)] for _ in range(Col)]

print(explore(grid,0,0,2,2,Row,Col,dp))
Comments (2)