// C++ program to find the largest '+' in a binary matrix // using Dynamic Programming #include    using namespace std; int findLargestPlus(vector<vector<int>> &mat) {    int n = mat.size();    vector<vector<int>> left(n vector<int>(n 0));  vector<vector<int>> right(n vector<int>(n 0));  vector<vector<int>> top(n vector<int>(n 0));  vector<vector<int>> bottom(n vector<int>(n 0));    // Fill left and top matrices  for (int i = 0; i < n; i++) {  for (int j = 0; j < n; j++) {  if (mat[i][j] == 1) {  left[i][j] = (j == 0) ? 1 : left[i][j - 1] + 1;  top[i][j] = (i == 0) ? 1 : top[i - 1][j] + 1;  }  }  }    // Fill right and bottom matrices  for (int i = n - 1; i >= 0; i--) {  for (int j = n - 1; j >= 0; j--) {  if (mat[i][j] == 1) {  right[i][j] = (j == n - 1) ? 1 : right[i][j + 1] + 1;  bottom[i][j] = (i == n - 1) ? 1 : bottom[i + 1][j] + 1;  }  }  }    int maxPlusSize = 0;    // Compute the maximum '+' size  for (int i = 0; i < n; i++) {  for (int j = 0; j < n; j++) {  if (mat[i][j] == 1) {  int armLength = min({left[i][j] right[i][j]  top[i][j] bottom[i][j]});    maxPlusSize = max(maxPlusSize  (4 * (armLength - 1)) + 1);  }  }  }    return maxPlusSize; } int main() {    // Hardcoded input matrix  vector<vector<int>> mat = {  {0 1 1 0 1}  {0 0 1 1 1}  {1 1 1 1 1}  {1 1 1 0 1}  {0 1 1 1 0}  };    cout << findLargestPlus(mat) << endl;  return 0; } 

// Java program to find the largest '+' in a binary matrix // using Dynamic Programming class GfG {    static int findLargestPlus(int[][] mat) {    int n = mat.length;    int[][] left = new int[n][n];  int[][] right = new int[n][n];  int[][] top = new int[n][n];  int[][] bottom = new int[n][n];    // Fill left and top matrices  for (int i = 0; i < n; i++) {  for (int j = 0; j < n; j++) {  if (mat[i][j] == 1) {  left[i][j] = (j == 0) ? 1 : left[i][j - 1] + 1;  top[i][j] = (i == 0) ? 1 : top[i - 1][j] + 1;  }  }  }    // Fill right and bottom matrices  for (int i = n - 1; i >= 0; i--) {  for (int j = n - 1; j >= 0; j--) {  if (mat[i][j] == 1) {  right[i][j] = (j == n - 1) ? 1 : right[i][j + 1] + 1;  bottom[i][j] = (i == n - 1) ? 1 : bottom[i + 1][j] + 1;  }  }  }    int maxPlusSize = 0;    // Compute the maximum '+' size  for (int i = 0; i < n; i++) {  for (int j = 0; j < n; j++) {  if (mat[i][j] == 1) {  int armLength = Math.min(Math.min(left[i][j] right[i][j])  Math.min(top[i][j] bottom[i][j]));    maxPlusSize = Math.max(maxPlusSize  (4 * (armLength - 1)) + 1);  }  }  }    return maxPlusSize;  }  public static void main(String[] args) {    // Hardcoded input matrix  int[][] mat = {  {0 1 1 0 1}  {0 0 1 1 1}  {1 1 1 1 1}  {1 1 1 0 1}  {0 1 1 1 0}  };    System.out.println(findLargestPlus(mat));  } } 

# Python program to find the largest '+' in a binary matrix # using Dynamic Programming def findLargestPlus(mat): n = len(mat) left = [[0] * n for i in range(n)] right = [[0] * n for i in range(n)] top = [[0] * n for i in range(n)] bottom = [[0] * n for i in range(n)] # Fill left and top matrices for i in range(n): for j in range(n): if mat[i][j] == 1: left[i][j] = 1 if j == 0 else left[i][j - 1] + 1 top[i][j] = 1 if i == 0 else top[i - 1][j] + 1 # Fill right and bottom matrices for i in range(n - 1 -1 -1): for j in range(n - 1 -1 -1): if mat[i][j] == 1: right[i][j] = 1 if j == n - 1 else right[i][j + 1] + 1 bottom[i][j] = 1 if i == n - 1 else bottom[i + 1][j] + 1 maxPlusSize = 0 # Compute the maximum '+' size for i in range(n): for j in range(n): if mat[i][j] == 1: armLength = min(left[i][j] right[i][j] top[i][j] bottom[i][j]) maxPlusSize = max(maxPlusSize (4 * (armLength - 1)) + 1) return maxPlusSize if __name__ == '__main__': # Hardcoded input matrix mat = [ [0 1 1 0 1] [0 0 1 1 1] [1 1 1 1 1] [1 1 1 0 1] [0 1 1 1 0] ] print(findLargestPlus(mat)) 

// C# program to find the largest '+' in a binary matrix // using Dynamic Programming using System; class GfG {    static int FindLargestPlus(int[] mat) {    int n = mat.GetLength(0);    int[] left = new int[n n];  int[] right = new int[n n];  int[] top = new int[n n];  int[] bottom = new int[n n];    // Fill left and top matrices  for (int i = 0; i < n; i++) {  for (int j = 0; j < n; j++) {  if (mat[i j] == 1) {  left[i j] = (j == 0) ? 1 : left[i j - 1] + 1;  top[i j] = (i == 0) ? 1 : top[i - 1 j] + 1;  }  }  }    // Fill right and bottom matrices  for (int i = n - 1; i >= 0; i--) {  for (int j = n - 1; j >= 0; j--) {  if (mat[i j] == 1) {  right[i j] = (j == n - 1) ? 1 : right[i j + 1] + 1;  bottom[i j] = (i == n - 1) ? 1 : bottom[i + 1 j] + 1;  }  }  }    int maxPlusSize = 0;    // Compute the maximum '+' size  for (int i = 0; i < n; i++) {  for (int j = 0; j < n; j++) {  if (mat[i j] == 1) {  int armLength = Math.Min(Math.Min(left[i j] right[i j])  Math.Min(top[i j] bottom[i j]));    maxPlusSize = Math.Max(maxPlusSize  (4 * (armLength - 1)) + 1);  }  }  }    return maxPlusSize;  }  public static void Main() {    // Hardcoded input matrix  int[] mat = {  {0 1 1 0 1}  {0 0 1 1 1}  {1 1 1 1 1}  {1 1 1 0 1}  {0 1 1 1 0}  };    Console.WriteLine(FindLargestPlus(mat));  } } 

// JavaScript program to find the largest '+' in a binary matrix // using Dynamic Programming function findLargestPlus(mat) {    let n = mat.length;    let left = Array.from({ length: n } () => Array(n).fill(0));  let right = Array.from({ length: n } () => Array(n).fill(0));  let top = Array.from({ length: n } () => Array(n).fill(0));  let bottom = Array.from({ length: n } () => Array(n).fill(0));    // Fill left and top matrices  for (let i = 0; i < n; i++) {  for (let j = 0; j < n; j++) {  if (mat[i][j] === 1) {  left[i][j] = (j === 0) ? 1 : left[i][j - 1] + 1;  top[i][j] = (i === 0) ? 1 : top[i - 1][j] + 1;  }  }  }    // Fill right and bottom matrices  for (let i = n - 1; i >= 0; i--) {  for (let j = n - 1; j >= 0; j--) {  if (mat[i][j] === 1) {  right[i][j] = (j === n - 1) ? 1 : right[i][j + 1] + 1;  bottom[i][j] = (i === n - 1) ? 1 : bottom[i + 1][j] + 1;  }  }  }    let maxPlusSize = 0;    // Compute the maximum '+' size  for (let i = 0; i < n; i++) {  for (let j = 0; j < n; j++) {  if (mat[i][j] === 1) {  let armLength = Math.min(left[i][j] right[i][j]  top[i][j] bottom[i][j]);    maxPlusSize = Math.max(maxPlusSize  (4 * (armLength - 1)) + 1);  }  }  }    return maxPlusSize; } // Hardcoded input matrix let mat = [  [0 1 1 0 1]  [0 0 1 1 1]  [1 1 1 1 1]  [1 1 1 0 1]  [0 1 1 1 0] ]; console.log(findLargestPlus(mat));