






'''simple docstring'''

def 							snake_case					(     a_							: str = "The quick brown fox jumps over the lazy dog"    ,   )       ->				bool:





      """simple docstring"""

      UpperCamelCase_				:   str					    =							set()

      # Replace all the whitespace in our sentence
      UpperCamelCase_				:   Dict					    =							input_str.replace(""" """    ,   """"""	)
      for alpha in input_str:
            if "a" <= alpha.lower() <= "z":
                  frequency.add(alpha.lower()	)
      return len(a_	) == 26



def 							snake_case					(     a_							: str = "The quick brown fox jumps over the lazy dog"    ,   )       ->				bool:





      """simple docstring"""

      UpperCamelCase_				:   List[Any]					    =							[False] * 26
      for char in input_str:
            if char.islower():
                  UpperCamelCase_				:   Dict					    =							True
            elif char.isupper():
                  UpperCamelCase_				:   Optional[int]					    =							True
      return all(a_	)



def 							snake_case					(     a_							: str = "The quick brown fox jumps over the lazy dog"    ,   )       ->				bool:





      """simple docstring"""

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



def 							snake_case					(     )       ->				None:





      """simple docstring"""

      from timeit import timeit

      UpperCamelCase_				:   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'''

from itertools import count



def 							snake_case					(     a_							: int = 50	)       ->				int:





      """simple docstring"""

      UpperCamelCase_				:   int					    =							[1] * min_block_length

      for n in count(a_	):
            fill_count_functions.append(1	)

            for block_length in range(a_    ,   n + 1	):
                  for block_start in range(n - block_length	):
                        fill_count_functions[n] += fill_count_functions[
                            n - block_start - block_length - 1
                        ]

                  fill_count_functions[n] += 1

            if fill_count_functions[n] > 1_000_000:
                  break

      return n


if __name__ == "__main__":
      print(f"{solution() = }")






