





'''simple docstring'''

import requests
from bsa import BeautifulSoup







def  a__    (    lowercase :					str = "AAPL"				)		->		str:





     """simple docstring"""

     _UpperCamelCase       =	F"""https://in.finance.yahoo.com/quote/{symbol}?s={symbol}"""
     _UpperCamelCase       =	BeautifulSoup(requests.get(lowercase				).text, '''html.parser'''				)
     _UpperCamelCase       =	'''My(6px) Pos(r) smartphone_Mt(6px)'''
     return soup.find('''div''', class_=class_				).find('''span'''				).text


if __name__ == "__main__":
   for symbol in "AAPL AMZN IBM GOOG MSFT ORCL".split():
      print(F"""Current {symbol:<4} stock price is {stock_price(symbol):>8}""")










'''simple docstring'''

def  a__    (    lowercase :					int, lowercase :					int, lowercase :					list[list[int]]				)		->		int:





     """simple docstring"""

     def update_area_of_max_square(lowercase :					int, lowercase :					int				) -> int:
          # BASE CASE
          if row >= rows or col >= cols:
               return 0

          _UpperCamelCase       =	update_area_of_max_square(lowercase, col + 1				)
          _UpperCamelCase       =	update_area_of_max_square(row + 1, col + 1				)
          _UpperCamelCase       =	update_area_of_max_square(row + 1, lowercase				)

          if mat[row][col]:
               _UpperCamelCase       =	1 + min([right, diagonal, down]				)
               _UpperCamelCase       =	max(largest_square_area[0], lowercase				)
               return sub_problem_sol
          else:
               return 0

     _UpperCamelCase       =	[0]
     update_area_of_max_square(0, 0				)
     return largest_square_area[0]







def  a__    (    lowercase :					int, lowercase :					int, lowercase :					list[list[int]]				)		->		int:





     """simple docstring"""

     def update_area_of_max_square_using_dp_array(
         lowercase :					int, lowercase :					int, lowercase :					list[list[int]]				) -> int:
          if row >= rows or col >= cols:
               return 0
          if dp_array[row][col] != -1:
               return dp_array[row][col]

          _UpperCamelCase       =	update_area_of_max_square_using_dp_array(lowercase, col + 1, lowercase				)
          _UpperCamelCase       =	update_area_of_max_square_using_dp_array(row + 1, col + 1, lowercase				)
          _UpperCamelCase       =	update_area_of_max_square_using_dp_array(row + 1, lowercase, lowercase				)

          if mat[row][col]:
               _UpperCamelCase       =	1 + min([right, diagonal, down]				)
               _UpperCamelCase       =	max(largest_square_area[0], lowercase				)
               _UpperCamelCase       =	sub_problem_sol
               return sub_problem_sol
          else:
               return 0

     _UpperCamelCase       =	[0]
     _UpperCamelCase       =	[[-1] * cols for _ in range(lowercase				)]
     update_area_of_max_square_using_dp_array(0, 0, lowercase				)

     return largest_square_area[0]







def  a__    (    lowercase :					int, lowercase :					int, lowercase :					list[list[int]]				)		->		int:





     """simple docstring"""

     _UpperCamelCase       =	[[0] * (cols + 1) for _ in range(rows + 1				)]
     _UpperCamelCase       =	0
     for row in range(rows - 1, -1, -1				):
          for col in range(cols - 1, -1, -1				):
               _UpperCamelCase       =	dp_array[row][col + 1]
               _UpperCamelCase       =	dp_array[row + 1][col + 1]
               _UpperCamelCase       =	dp_array[row + 1][col]

               if mat[row][col] == 1:
                    _UpperCamelCase       =	1 + min(lowercase, lowercase, lowercase				)
                    _UpperCamelCase       =	max(dp_array[row][col], lowercase				)
               else:
                    _UpperCamelCase       =	0

     return largest_square_area







def  a__    (    lowercase :					int, lowercase :					int, lowercase :					list[list[int]]				)		->		int:





     """simple docstring"""

     _UpperCamelCase       =	[0] * (cols + 1)
     _UpperCamelCase       =	[0] * (cols + 1)
     _UpperCamelCase       =	0
     for row in range(rows - 1, -1, -1				):
          for col in range(cols - 1, -1, -1				):
               _UpperCamelCase       =	current_row[col + 1]
               _UpperCamelCase       =	next_row[col + 1]
               _UpperCamelCase       =	next_row[col]

               if mat[row][col] == 1:
                    _UpperCamelCase       =	1 + min(lowercase, lowercase, lowercase				)
                    _UpperCamelCase       =	max(current_row[col], lowercase				)
               else:
                    _UpperCamelCase       =	0
          _UpperCamelCase       =	current_row

     return largest_square_area


if __name__ == "__main__":
   import doctest

   doctest.testmod()
   print(largest_square_area_in_matrix_bottom_up(2, 2, [[1, 1], [1, 1]]))



