



from __future__ import annotations





def 							A	(     _UpperCAmelCase				:   Any							,   _UpperCAmelCase				:   Dict    )				-> list[int]:







			'''simple docstring'''
			_UpperCAmelCase		       =   0
			_UpperCAmelCase		       =   len(a__    ) - 1

			while i < j:
						if nums[i] + nums[j] == target:
									return [i, j]
						elif nums[i] + nums[j] < target:
									_UpperCAmelCase		       =   i + 1
						else:
									_UpperCAmelCase		       =   j - 1

			return []


if __name__ == "__main__":
							import doctest

							doctest.testmod()
							print(f"""{two_pointer([2, 7, 11, 15], 9) = }""")


from __future__ import annotations

import typing
from collections import Counter


def     __lowerCAmelCase			(			a__  )       ->  typing.Counter[int]:
				__a										=    Counter()
				for base in range(1						,    max_perimeter + 1  ):
								for perpendicular in range(a__						,    max_perimeter + 1  ):
												__a										=    (base * base + perpendicular * perpendicular) ** 0.5
												if hypotenuse == int(a__  ):
																__a										=    int(base + perpendicular + hypotenuse  )
																if perimeter > max_perimeter:
																				continue
																triplets[perimeter] += 1
				return triplets


def     __lowerCAmelCase			(			a__ = 1000  )       ->  int:
				__a										=    pythagorean_triple(a__  )
				return triplets.most_common(1  )[0][0]


if __name__ == "__main__":
					print(F"Perimeter {solution()} has maximum solutions")