text: /** https://leetcode.com/problems/maximal-square/ */
  
  
  
  /**
   * Given an m x n binary matrix filled with 0's and 1's, find the largest square containing only 1's and return its area.
   */
  
  
  int maximalSquare(char** matrix, int matrixSize, int* matrixColSize){
      
  }
      