comefrom: <gouthampradhan>dynamic_programming_LargestPlusSign_1.java
code: public int orderOfLargestPlusSign(int N, int[][] mines) {
      int[][] A = new int[N][N]; 
      int[][] B = new int[N][N]; 
      for (int[] row : mines) {
        int r = row[0];
        int c = row[1];
        A[r][c] = 1;
      }
      for (int i = 0; i < A.length; i++) {
        for (int j = 0; j < A[0].length; j++) {
          if (A[i][j] == 0) {
            A[i][j] = 1;
          } else {
            A[i][j] = 0;
          }
          B[i][j] = Integer.MAX_VALUE;
        }
      }
      for (int i = 0; i < A.length; i++) {
        int prev = 0;
        for (int j = 0; j < A[0].length; j++) {
          if (A[i][j] == 0) {
            prev = 0;
            B[i][j] = 0;
          } else {
            prev++;
            B[i][j] = Math.min(B[i][j], prev);
          }
        }
        prev = 0;
        for (int j = N - 1; j >= 0; j--) {
          if (A[i][j] == 0) {
            prev = 0;
            B[i][j] = 0;
          } else {
            prev++;
            B[i][j] = Math.min(B[i][j], prev);
          }
        }
      }
      for (int j = 0; j < B[0].length; j++) {
        int prev = 0;
        for (int i = 0; i < B.length; i++) {
          if (A[i][j] == 0) {
            prev = 0;
            B[i][j] = 0;
          } else {
            prev++;
            B[i][j] = Math.min(B[i][j], prev);
          }
        }
        prev = 0;
        for (int i = N - 1; i >= 0; i--) {
          if (A[i][j] == 0) {
            prev = 0;
            B[i][j] = 0;
          } else {
            prev++;
            B[i][j] = Math.min(B[i][j], prev);
          }
        }
      }
      int result = 0;
      for (int i = 0; i < B.length; i++) {
        for (int j = 0; j < B[0].length; j++) {
          result = Math.max(result, B[i][j]);
        }
      }
      return result;
    }
masked: public int sample_funcname ( int var_0 , int [ ] [ ] var_1 ) {
    int [ ] [ ] var_2 = new int [ var_0 ] [ var_0 ] ;
    int [ ] [ ] var_3 = new int [ var_0 ] [ var_0 ] ;
    for ( int [ ] var_4 : var_1 ) {
      int var_5 = var_4 [ 0 ] ;
      int var_6 = var_4 [ 1 ] ;
      var_2 [ var_5 ] [ var_6 ] = 1 ;
    }
    for ( int var_7 = 0 ;
    var_7 < var_2 . length ;
    var_7 ++ ) {
      for ( int var_8 = 0 ;
      var_8 < var_2 [ 0 ] . length ;
      var_8 ++ ) {
        if ( var_2 [ var_7 ] [ var_8 ] == 0 ) {
          var_2 [ var_7 ] [ var_8 ] = 1 ;
        }
        else {
          var_2 [ var_7 ] [ var_8 ] = 0 ;
        }
        var_3 [ var_7 ] [ var_8 ] = Integer . MAX_VALUE ;
      }
    }
    for ( int var_7 = 0 ;
    var_7 < var_2 . length ;
    var_7 ++ ) {
      int var_9 = 0 ;
      for ( int var_8 = 0 ;
      var_8 < var_2 [ 0 ] . length ;
      var_8 ++ ) {
        if ( var_2 [ var_7 ] [ var_8 ] == 0 ) {
          var_9 = 0 ;
          var_3 [ var_7 ] [ var_8 ] = 0 ;
        }
        else {
          var_9 ++ ;
          var_3 [ var_7 ] [ var_8 ] = Math . min ( var_3 [ var_7 ] [ var_8 ] , var_9 ) ;
        }
      }
      var_9 = 0 ;
      for ( int var_8 = var_0 - 1 ;
      var_8 >= 0 ;
      var_8 -- ) {
        if ( var_2 [ var_7 ] [ var_8 ] == 0 ) {
          var_9 = 0 ;
          var_3 [ var_7 ] [ var_8 ] = 0 ;
        }
        else {
          var_9 ++ ;
          var_3 [ var_7 ] [ var_8 ] = Math . min ( var_3 [ var_7 ] [ var_8 ] , var_9 ) ;
        }
      }
    }
    for ( int var_8 = 0 ;
    var_8 < var_3 [ 0 ] . length ;
    var_8 ++ ) {
      int var_9 = 0 ;
      for ( int var_7 = 0 ;
      var_7 < var_3 . length ;
      var_7 ++ ) {
        if ( var_2 [ var_7 ] [ var_8 ] == 0 ) {
          var_9 = 0 ;
          var_3 [ var_7 ] [ var_8 ] = 0 ;
        }
        else {
          var_9 ++ ;
          var_3 [ var_7 ] [ var_8 ] = Math . min ( var_3 [ var_7 ] [ var_8 ] , var_9 ) ;
        }
      }
      var_9 = 0 ;
      for ( int var_7 = var_0 - 1 ;
      var_7 >= 0 ;
      var_7 -- ) {
        if ( var_2 [ var_7 ] [ var_8 ] == 0 ) {
          var_9 = 0 ;
          var_3 [ var_7 ] [ var_8 ] = 0 ;
        }
        else {
          var_9 ++ ;
          var_3 [ var_7 ] [ var_8 ] = Math . min ( var_3 [ var_7 ] [ var_8 ] , var_9 ) ;
        }
      }
    }
    int var_10 = 0 ;
    for ( int var_7 = 0 ;
    var_7 < var_3 . length ;
    var_7 ++ ) {
      for ( int var_8 = 0 ;
      var_8 < var_3 [ 0 ] . length ;
      var_8 ++ ) {
        var_10 = Math . max ( var_10 , var_3 [ var_7 ] [ var_8 ] ) ;
      }
    }
    return var_10 ;
  }
  