SodhanaLibrary

function uniquePathsWithObstacles(obstacleGrid) {
    if(obstacleGrid==null||obstacleGrid.length==0)
        return 0;
 
    var m = obstacleGrid.length;
    var n = obstacleGrid[0].length;
 
    if(obstacleGrid[0][0]==1||obstacleGrid[m-1][n-1]==1) 
        return 0;
 
    var dp = [];
    for(var i=0; i<m; i++){
        var temp = [];
        for(var j=0; j<n; j++){
            temp.push(0);
        }
        dp.push(temp);
    }
    
    dp[0][0]=1;
 
    //left column
    for(var i=1; i<m; i++){
        if(obstacleGrid[i][0]==1){
            dp[i][0] = 0;
        }else{
            dp[i][0] = dp[i-1][0];
        }
    }
 
    //top row
     for(var i=1; i<n; i++){
        if(obstacleGrid[0][i]==1){
            dp[0][i] = 0;
        }else{
            dp[0][i] = dp[0][i-1];
        }
    }
    
    //fill up cells inside
    for(var i=1; i<m; i++){
        for(var j=1; j<n; j++){
            if(obstacleGrid[i][j]==1){
                dp[i][j]=0;
            }else{
                dp[i][j]=dp[i-1][j]+dp[i][j-1];
            }
        }
    }
 
    return dp[m-1][n-1];
}