

def 					__lowercase      (     _A = "The quick brown fox jumps over the lazy dog"						,    )     ->						bool:
      SCREAMING_SNAKE_CASE :      Optional[int]       =   set()

      # Replace all the whitespace in our sentence
      SCREAMING_SNAKE_CASE :      Optional[int]       =   input_str.replace(""" """						,    """"""			)
      for alpha in input_str:
            if "a" <= alpha.lower() <= "z":
                  frequency.add(alpha.lower()			)
      return len(_A			) == 26






def 					__lowercase      (     _A = "The quick brown fox jumps over the lazy dog"						,    )     ->						bool:
      SCREAMING_SNAKE_CASE :      List[Any]       =   [False] * 26
      for char in input_str:
            if char.islower():
                  SCREAMING_SNAKE_CASE :      Optional[Any]       =   True
            elif char.isupper():
                  SCREAMING_SNAKE_CASE :      Any       =   True
      return all(_A			)






def 					__lowercase      (     _A = "The quick brown fox jumps over the lazy dog"						,    )     ->						bool:
      return len({char for char in input_str.lower() if char.isalpha()}			) == 26






def 					__lowercase      (     )     ->						None:
      from timeit import timeit

      SCREAMING_SNAKE_CASE :      int       =   """from __main__ import is_pangram, is_pangram_faster, is_pangram_fastest"""
      print(timeit("""is_pangram()"""						,    setup=_A			)			)
      print(timeit("""is_pangram_faster()"""						,    setup=_A			)			)
      print(timeit("""is_pangram_fastest()"""						,    setup=_A			)			)
      # 5.348480500048026, 2.6477354579837993, 1.8470395830227062
      # 5.036091582966037, 2.644472333951853,  1.8869528750656173


if __name__ == "__main__":
  import doctest

  doctest.testmod()
  benchmark()







def 					__lowercase      (     _A						,    _A			)     ->						int:
      assert x is not None
      assert y is not None

      SCREAMING_SNAKE_CASE :      int       =   len(_A			)
      SCREAMING_SNAKE_CASE :      Union[str, Any]       =   len(_A			)

      # declaring the array for storing the dp values
      SCREAMING_SNAKE_CASE :      Tuple       =   [[0] * (n + 1) for _ in range(m + 1			)]  # noqa: E741

      for i in range(1						,    m + 1			):
            for j in range(1						,    n + 1			):
                  SCREAMING_SNAKE_CASE :      List[Any]       =   1 if x[i - 1] == y[j - 1] else 0

                  SCREAMING_SNAKE_CASE :      int       =   max(l[i - 1][j]						,    l[i][j - 1]						,    l[i - 1][j - 1] + match			)

      SCREAMING_SNAKE_CASE :      int       =   """"""
      SCREAMING_SNAKE_CASE     ,	SCREAMING_SNAKE_CASE :      int       =   m, n
      while i > 0 and j > 0:
            SCREAMING_SNAKE_CASE :      Tuple       =   1 if x[i - 1] == y[j - 1] else 0

            if l[i][j] == l[i - 1][j - 1] + match:
                  if match == 1:
                        SCREAMING_SNAKE_CASE :      List[Any]       =   x[i - 1] + seq
                  i -= 1
                  j -= 1
            elif l[i][j] == l[i - 1][j]:
                  i -= 1
            else:
                  j -= 1

      return l[m][n], seq


if __name__ == "__main__":
  UpperCAmelCase__ :     str				    =    """AGGTAB"""
  UpperCAmelCase__ :     Optional[int]				    =    """GXTXAYB"""
  UpperCAmelCase__ :     Tuple				    =    4
  UpperCAmelCase__ :     Dict				    =    """GTAB"""

  UpperCAmelCase__    ,   UpperCAmelCase__ :     Optional[int]				    =    longest_common_subsequence(a, b)
  print("""len =""", ln, """, sub-sequence =""", subseq)
  import doctest

  doctest.testmod()




