'''simple docstring'''

def       __UpperCamelCase	(       UpperCAmelCase = "The quick brown fox jumps over the lazy dog"		,					):
 lowercase__    :   str						= set()

 # Replace all the whitespace in our sentence
 lowercase__    :   int						= input_str.replace(''' '''		,					''''''					)
 for alpha in input_str:
  if "a" <= alpha.lower() <= "z":
   frequency.add(alpha.lower()					)
 return len(UpperCAmelCase					) == 26
def       __UpperCamelCase	(       UpperCAmelCase = "The quick brown fox jumps over the lazy dog"		,					):
 lowercase__    :   Tuple						= [False] * 26
 for char in input_str:
  if char.islower():
   lowercase__    :   Optional[Any]						= True
  elif char.isupper():
   lowercase__    :   Optional[int]						= True
 return all(UpperCAmelCase					)
def       __UpperCamelCase	(       UpperCAmelCase = "The quick brown fox jumps over the lazy dog"		,					):
 return len({char for char in input_str.lower() if char.isalpha()}					) == 26
def       __UpperCamelCase	(       ):
 from timeit import timeit

 lowercase__    :   List[Any]						= '''from __main__ import is_pangram, is_pangram_faster, is_pangram_fastest'''
 print(timeit('''is_pangram()'''		,					setup=UpperCAmelCase					)					)
 print(timeit('''is_pangram_faster()'''		,					setup=UpperCAmelCase					)					)
 print(timeit('''is_pangram_fastest()'''		,					setup=UpperCAmelCase					)					)
 # 5.348480500048026, 2.6477354579837993, 1.8470395830227062
 # 5.036091582966037, 2.644472333951853,  1.8869528750656173


if __name__ == "__main__":
  import doctest

  doctest.testmod()
  benchmark()


'''simple docstring'''

def       __UpperCamelCase	(       UpperCAmelCase		,					UpperCAmelCase					):
 lowercase__    :   Dict						= len(UpperCAmelCase					)
 print('''The following activities are selected:'''					)

 # The first activity is always selected
 lowercase__    :   str						= 0
 print(UpperCAmelCase		,					end=''','''					)

 # Consider rest of the activities
 for j in range(UpperCAmelCase					):
  # If this activity has start time greater than
  # or equal to the finish time of previously
  # selected activity, then select it
  if start[j] >= finish[i]:
   print(UpperCAmelCase		,					end=''','''					)
   lowercase__    :   str						= j


if __name__ == "__main__":
  import doctest

  doctest.testmod()

  __a:			str	       =       [1, 3, 0, 5, 8, 5]
  __a:			Optional[Any]	       =       [2, 4, 6, 7, 9, 9]
  print_max_activities(start, finish)

