


def __UpperCAmelCase       (		__A = "The quick brown fox jumps over the lazy dog" ,						)						->					bool:



       '''simple docstring'''





       UpperCAmelCase__										=     set()

       # Replace all the whitespace in our sentence
       UpperCAmelCase__										=     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" ,						)						->					bool:



       '''simple docstring'''





       UpperCAmelCase__										=     [False] * 2_6
       for char in input_str:
              if char.islower():
                     UpperCAmelCase__										=     True
              elif char.isupper():
                     UpperCAmelCase__										=     True
       return all(__A			)





def __UpperCAmelCase       (		__A = "The quick brown fox jumps over the lazy dog" ,						)						->					bool:



       '''simple docstring'''





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





def __UpperCAmelCase       (		)						->					None:



       '''simple docstring'''





       from timeit import timeit

       UpperCAmelCase__										=     "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()









from __future__ import annotations





def __UpperCAmelCase       (		__A			)						->					list[int]:



       '''simple docstring'''





       UpperCAmelCase__										=     [True] * limit
       UpperCAmelCase__										=     False
       UpperCAmelCase__										=     False
       UpperCAmelCase__										=     True

       for i in range(3 ,						int(limit**0.5 + 1			) ,						2			):
              UpperCAmelCase__										=     i * 2
              while index < limit:
                     UpperCAmelCase__										=     False
                     UpperCAmelCase__										=     index + i

       UpperCAmelCase__										=     [2]

       for i in range(3 ,						__A ,						2			):
              if is_prime[i]:
                     primes.append(__A			)

       return primes





def __UpperCAmelCase       (		__A = 1_0_0_0_0_0_0			)						->					int:



       '''simple docstring'''





       UpperCAmelCase__										=     prime_sieve(__A			)
       UpperCAmelCase__										=     0
       UpperCAmelCase__										=     0

       for i in range(len(__A			)			):
              for j in range(i + length ,						len(__A			)			):
                     UpperCAmelCase__										=     sum(primes[i:j]			)
                     if sol >= ceiling:
                            break

                     if sol in primes:
                            UpperCAmelCase__										=     j - i
                            UpperCAmelCase__										=     sol

       return largest


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





