


"""simple docstring"""




def        lowercase							(		lowerCAmelCase__ :     str = "The quick brown fox jumps over the lazy dog"    ,					) ->      bool:
		__a           =			set()

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

def        lowercase							(		lowerCAmelCase__ :     str = "The quick brown fox jumps over the lazy dog"    ,					) ->      bool:
		__a           =			[False] * 26
		for char in input_str:
				if char.islower():
						__a           =			True
				elif char.isupper():
						__a           =			True
		return all(lowerCAmelCase__			)

def        lowercase							(		lowerCAmelCase__ :     str = "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

		__a           =			'''from __main__ import is_pangram, is_pangram_faster, is_pangram_fastest'''
		print(timeit('''is_pangram()'''    ,					setup=lowerCAmelCase__			)			)
		print(timeit('''is_pangram_faster()'''    ,					setup=lowerCAmelCase__			)			)
		print(timeit('''is_pangram_fastest()'''    ,					setup=lowerCAmelCase__			)			)
		# 5.348480500048026, 2.6477354579837993, 1.8470395830227062
		# 5.036091582966037, 2.644472333951853,  1.8869528750656173


if __name__ == "__main__":
				import doctest

				doctest.testmod()
				benchmark()










from __future__ import annotations

from collections.abc import Iterable, Iterator
from dataclasses import dataclass

SCREAMING_SNAKE_CASE       :      Tuple												= (3, 9, -11, 0, 7, 5, 1, -1)
SCREAMING_SNAKE_CASE       :      Union[str, Any]												= (4, 6, 2, 0, 8, 10, 3, -2)






@dataclass
class _lowerCamelCase:
       lowercase_ :	int
       lowercase_ :	Node | None






class _lowerCamelCase:
       def __init__(					self,      lowerCamelCase)       ->   None:




           """simple docstring"""

           _lowercase       :							Node | None      		=		None
           for i in sorted(lowerCamelCase,      reverse=lowerCamelCase):
               _lowercase       :							Tuple      		=		Node(lowerCamelCase,      self.head)
       def __iter__(					self)       ->   Iterator[int]:




           """simple docstring"""

           _lowercase       :							Union[str, Any]      		=		self.head
           while node:
               yield node.data
               _lowercase       :							int      		=		node.next_node
       def __len__(					self)       ->   int:




           """simple docstring"""

           return sum(1 for _ in self)




       def __str__(					self)       ->   str:




           """simple docstring"""

           return " -> ".join([str(lowerCamelCase) for node in self])



def 				UpperCamelCase_(      lowerCamelCase_							, lowerCamelCase_ )    ->						SortedLinkedList:
    return SortedLinkedList(list(lowerCamelCase_ ) + list(lowerCamelCase_ ) )


if __name__ == "__main__":
 import doctest

 doctest.testmod()
 SCREAMING_SNAKE_CASE       :      int												= SortedLinkedList
 print(merge_lists(SSL(test_data_odd), SSL(test_data_even)))


