code: 
  import sys
  
  
  
  def 		UpperCamelCase    (					_UpperCAmelCase     :      int   , _UpperCAmelCase     :      list[int]     )      -> int:
  
  
  
  
  
  
  						'''simple docstring'''
  
  						if not numbers:
  												return 0
  						if target == 0 and target in numbers:
  												return 0
  						if not isinstance(_UpperCAmelCase   , (list, tuple)     ) or not all(
  						    isinstance(_UpperCAmelCase   , _UpperCAmelCase     ) for number in numbers     ):
  												raise ValueError("numbers must be an iterable of integers"     )
  
  						_lowercase					:  Optional[Any]    			=      0
  						_lowercase					:  List[str]    			=      sys.maxsize
  
  						while right < len(_UpperCAmelCase     ):
  												curr_sum += numbers[right]
  												while curr_sum >= target and left <= right:
  																		_lowercase					:  Any    			=      min(_UpperCAmelCase   , right - left + 1     )
  																		curr_sum -= numbers[left]
  																		left += 1
  												right += 1
  
  						return 0 if min_len == sys.maxsize else min_len
  
  
  
  
  
style_context: 
  from __future__ import annotations
  
  
  
  def 		UpperCamelCase    (					_UpperCAmelCase     :      list[int]   , _UpperCAmelCase     :      int     )      -> int:
  
  
  
  
  
  
  						'''simple docstring'''
  
  						_lowercase			,						_lowercase					:  Any    			=      0, len(_UpperCAmelCase     ) - 1
  						while start_ind <= end_ind:
  												if array[start_ind] == search_item:
  																		return start_ind
  												elif array[end_ind] == search_item:
  																		return end_ind
  												else:
  																		start_ind += 1
  																		end_ind -= 1
      # returns -1 if search_item is not found in array
  						return -1
  
  
  if __name__ == "__main__":
  							print(double_linear_search(list(range(100)), 40))
  
  
  
  
  