


def       _lowerCAmelCase    (				lowerCAmelCase_				:str		,    lowerCAmelCase_				:str				)->list:
   '''simple docstring'''






   snake_case_            =       len(lowerCAmelCase_				)
   snake_case_            =       []
   for i in range(len(lowerCAmelCase_				) - pat_len + 1				):
      snake_case_            =       True
      for j in range(lowerCAmelCase_				):
         if s[i + j] != pattern[j]:
            snake_case_            =       False
            break
      if match_found:
         position.append(lowerCAmelCase_				)
   return position


if __name__ == "__main__":
   assert naive_pattern_search('''ABCDEFG''', '''DE''') == [3]
   print(naive_pattern_search('''ABAAABCDBBABCDDEBCABC''', '''ABC'''))








from __future__ import annotations



def       _lowerCAmelCase    (				lowerCAmelCase_				:int		,    lowerCAmelCase_				:int				)->list[str]:
   '''simple docstring'''






   if partitions <= 0:
      raise ValueError("partitions must be a positive number!"				)
   if partitions > number_of_bytes:
      raise ValueError("partitions can not > number_of_bytes!"				)
   snake_case_            =       number_of_bytes // partitions
   snake_case_            =       []
   for i in range(lowerCAmelCase_				):
      snake_case_            =       i * bytes_per_partition + 1
      snake_case_            =       (
          number_of_bytes if i == partitions - 1 else (i + 1) * bytes_per_partition
      )
      allocation_list.append(F'''{start_bytes}-{end_bytes}'''				)
   return allocation_list


if __name__ == "__main__":
   import doctest

   doctest.testmod()




