text: #
  # Created on Tue Dec 07 2021
  #
  # The MIT License (MIT)
  # Copyright (c) 2021 Maatuq
  #
  # Permission is hereby granted, free of charge, to any person obtaining a copy of this software
  # and associated documentation files (the "Software"), to deal in the Software without restriction,
  # including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense,
  # and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so,
  # subject to the following conditions:
  #
  # The above copyright notice and this permission notice shall be included in all copies or substantial
  # portions of the Software.
  #
  # THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED
  # TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
  # THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
  # TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
  #
  class Solution:
      def maximalSquare(self, matrix: List[List[str]]) -> int:
          dp = [0] * (len(matrix[0]) + 1)
          max_side = 0
          prev = 0
          for i in range(1, len(matrix) + 1):
              for j in range(1, len(matrix[0]) + 1):
                  if matrix[i - 1][j - 1] == "1":
                      tmp = dp[j]
                      dp[j] = min(tmp, dp[j - 1], prev)
                      max_side = max(dp[j], max_side)
                  else:
                      dp[j] = 0
                  prev = tmp
          return max_side ** 2
  