


'''simple docstring'''




def    UpperCAmelCase_  (       A = "The quick brown fox jumps over the lazy dog"		,	):
   '''simple docstring'''





   _a					:  Tuple						=  set()

   # Replace all the whitespace in our sentence
   _a					:  int						=  input_str.replace(' '		,	''      )
   for alpha in input_str:
      if "a" <= alpha.lower() <= "z":
         frequency.add(alpha.lower()      )
   return len(A      ) == 2_6


def    UpperCAmelCase_  (       A = "The quick brown fox jumps over the lazy dog"		,	):
   '''simple docstring'''





   _a					:  Any						=  [False] * 2_6
   for char in input_str:
      if char.islower():
         _a					:  int						=  True
      elif char.isupper():
         _a					:  str						=  True
   return all(A      )


def    UpperCAmelCase_  (       A = "The quick brown fox jumps over the lazy dog"		,	):
   '''simple docstring'''





   return len({char for char in input_str.lower() if char.isalpha()}      ) == 2_6


def    UpperCAmelCase_  (       ):
   '''simple docstring'''





   from timeit import timeit

   _a					:  Dict						=  '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()






'''simple docstring'''




def    UpperCAmelCase_  (       A		,	A      ):
   '''simple docstring'''





   return "\n".join(
       f'''{number} * {i} = {number * i}''' for i in range(1		,	number_of_terms + 1      )      )


if __name__ == "__main__":
 print(multiplication_table(number=5, number_of_terms=10))


