
'''simple docstring'''





from __future__ import annotations

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

SCREAMING_SNAKE_CASE     =       (3, 9, -1_1, 0, 7, 5, 1, -1)
SCREAMING_SNAKE_CASE     =       (4, 6, 2, 0, 8, 1_0, 3, -2)






@dataclass
class 							UpperCAmelCase_							:

 '''simple docstring'''
 lowercase_					:    int
 lowercase_					:    Node | None






class 							UpperCAmelCase_							:

 '''simple docstring'''







 def __init__(					self		:  List[Any]			,				snake_case__		:  Iterable[int] ):



   '''simple docstring'''




   UpperCAmelCase__      :					Node | None				       =							None
   for i in sorted(snake_case__			,				reverse=snake_case__ ):
     UpperCAmelCase__      :					Optional[Any]				       =							Node(snake_case__			,				self.head )







 def __iter__(					self		:  Optional[int] ):



   '''simple docstring'''




   UpperCAmelCase__      :					List[str]				       =							self.head
   while node:
     yield node.data
     UpperCAmelCase__      :					Optional[Any]				       =							node.next_node







 def __len__(					self		:  int ):



   '''simple docstring'''




   return sum(1 for _ in self )







 def __str__(					self		:  List[str] ):



   '''simple docstring'''




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







def snake_case_     (					lowercase__   ,       lowercase__		):
  return SortedLinkedList(list(lowercase__		) + list(lowercase__		)		)


if __name__ == "__main__":
      import doctest

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





'''simple docstring'''





def snake_case_     (					lowercase__ = "The quick brown fox jumps over the lazy dog"   ,       ):
  UpperCAmelCase__      :					Dict				       =							set()

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







def snake_case_     (					lowercase__ = "The quick brown fox jumps over the lazy dog"   ,       ):
  UpperCAmelCase__      :					str				       =							[False] * 2_6
  for char in input_str:
    if char.islower():
      UpperCAmelCase__      :					List[Any]				       =							True
    elif char.isupper():
      UpperCAmelCase__      :					List[Any]				       =							True
  return all(lowercase__		)







def snake_case_     (					lowercase__ = "The quick brown fox jumps over the lazy dog"   ,       ):
  return len({char for char in input_str.lower() if char.isalpha()}		) == 2_6







def snake_case_     (					):
  from timeit import timeit

  UpperCAmelCase__      :					Union[str, Any]				       =							"from __main__ import is_pangram, is_pangram_faster, is_pangram_fastest"
  print(timeit("is_pangram()"   ,       setup=lowercase__		)		)
  print(timeit("is_pangram_faster()"   ,       setup=lowercase__		)		)
  print(timeit("is_pangram_fastest()"   ,       setup=lowercase__		)		)
  # 5.348480500048026, 2.6477354579837993, 1.8470395830227062
  # 5.036091582966037, 2.644472333951853,  1.8869528750656173


if __name__ == "__main__":
      import doctest

      doctest.testmod()
      benchmark()



