


from __future__ import annotations


def 		lowercase_  (     _UpperCamelCase       ,			_UpperCamelCase  ):


			'''simple docstring'''







			if len(_UpperCamelCase  ) < k or k < 0:
						raise ValueError('''Invalid Input'''  )
			__lowercase 					=   __lowercase 					=   sum(array[:k]  )
			for i in range(len(_UpperCamelCase  ) - k  ):
						__lowercase 					=   current_sum - array[i] + array[i + k]
						__lowercase 					=   max(_UpperCamelCase       ,			_UpperCamelCase  )
			return max_sum


if __name__ == "__main__":
	from doctest import testmod
	from random import randint

	testmod()
	a : Union[str, Any]		=				[randint(-1000, 1000) for i in range(100)]
	a : Optional[Any]		=				randint(0, 110)
	print(f'''The maximum sum of {k} consecutive elements is {max_sum_in_array(array,k)}''')






from __future__ import annotations

import typing
from collections.abc import Iterable

import numpy as np

a : Optional[int]		=				typing.Union[Iterable[float], Iterable[int], np.ndarray]  # noqa: UP007
a : Union[str, Any]		=				typing.Union[np.floataa, int, float]  # noqa: UP007


def 		lowercase_  (     _UpperCamelCase       ,			_UpperCamelCase  ):


			'''simple docstring'''







			return np.sqrt(np.sum((np.asarray(_UpperCamelCase  ) - np.asarray(_UpperCamelCase  )) ** 2  )  )


def 		lowercase_  (     _UpperCamelCase       ,			_UpperCamelCase  ):


			'''simple docstring'''







			return sum((va - va) ** 2 for va, va in zip(_UpperCamelCase       ,			_UpperCamelCase  )  ) ** (1 / 2)


if __name__ == "__main__":


	def 		lowercase_  (     ):


				'''simple docstring'''







				from timeit import timeit

				print('''Without Numpy'''  )
				print(
				    timeit(
				        '''euclidean_distance_no_np([1, 2, 3], [4, 5, 6])'''       ,			number=1_00_00       ,			globals=globals()       ,			)  )
				print('''With Numpy'''  )
				print(
				    timeit(
				        '''euclidean_distance([1, 2, 3], [4, 5, 6])'''       ,			number=1_00_00       ,			globals=globals()       ,			)  )





	benchmark()


